LLM for Coding Benchmarks and Datasets
LiveCodeBench, SWEBench, Aider Polyglot, BBH, HumanEval, MBPP, Common Crawl (Time Span, Dataset Size, Data Format, LLM Testing Capability)
HuangAnni's Blog
I’m Anni Huang, an AI researcher-in-training at ByteDance, specializing in LLM training operations with a strong coding focus. This blog is where I share papers I’ve read and insights I’ve gained.
Latest articles
How to change a base model to a reasoning model?
Turning a base model into a reasoning model is essentially a post-training + data problem
DeepSeek GRPO Explanation (Why we need it? How does it work? What are the findings?)
Explained with a simple mathematical formula for the loss function
Beyond Pre-training: The Power of RLHF in LLM Alignment
If LLM is compared to a person, then the early training is like general education, and the later training is like vocational training.
LeetCode Daily Challenge-3477. Fruits Into Baskets II(Easy, O(n²))
Unavoidable O(n²) - Optimal Solution in Python, Java, Golang, C, C#, C++
LeetCode Daily Challenge-904. Fruit Into Baskets(Python, Med, O(n))
Sliding window+Hashmap, Optimal Python Solution | TC O(n) SC O(1)
LeetCode Daily Challenge-2044 Count Number of Maximum Bitwise-OR Subsets
Problem Description LeetCode 2044: Count Number of Maximum Bitwise-OR Subsets Given an integer array nums, we need to: Find the maximum possible bitwise OR of any subset of nums Return the count of different non-empty subsets that achieve this max...
LeetCode Daily Challenge-2210 Count Hills and Valleys in an Array(Easy, Two Pointers, O(n))
Problem Description LeetCode 2210 asks us to count the number of hills and valleys in an array. A hill is an element that is strictly greater than its neighbors, while a valley is an element that is strictly smaller than its neighbors. The key challe...
LeetCode 1695-Maximum Erasure Value(Med, Java, O(n))
Problem Description 1695. Maximum Erasure Value This problem asks us to find the maximum sum of a contiguous subarray where all elements are unique (no duplicates). We need to identify the subarray with unique elements that has the largest sum and ...
