| Maximize Area of Square Hole in Grid | Medium | 61.9% | 100.0% | ArraySorting |
| Minimum Value to Get Positive Step by Step Sum | Easy | 64.6% | 100.0% | ArrayPrefix Sum |
| Next Greater Element I | Easy | 75.7% | 87.5% | ArrayHash TableStack+1 |
| Count Good Meals | Medium | 32.5% | 87.5% | ArrayHash Table |
| Sort Colors | Medium | 69.1% | 75.0% | ArrayTwo PointersSorting |
| Merge Sorted Array | Easy | 54.4% | 75.0% | ArrayTwo PointersSorting |
| Happy Number | Easy | 59.2% | 75.0% | Hash TableMathTwo Pointers |
| Course Schedule | Medium | 50.8% | 75.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Valid Parentheses | Easy | 43.7% | 62.5% | StringStack |
| Integer to Roman | Medium | 70.4% | 62.5% | Hash TableMathString |
| Daily Temperatures | Medium | 68.3% | 62.5% | ArrayStackMonotonic Stack |
| Fair Candy Swap | Easy | 64.5% | 62.5% | ArrayHash TableBinary Search+1 |
| Edit Distance | Medium | 60.1% | 62.5% | StringDynamic Programming |
| Unique Binary Search Trees | Medium | 63.3% | 62.5% | MathDynamic ProgrammingTree+2 |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 62.5% | ArrayDynamic Programming |
| Merge Two Sorted Lists | Easy | 67.9% | 50.0% | Linked ListRecursion |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 50.0% | ArrayBinary SearchDynamic Programming+1 |
| First Missing Positive | Hard | 42.4% | 50.0% | ArrayHash Table |
| Subarray Sum Equals K | Medium | 46.8% | 50.0% | ArrayHash TablePrefix Sum |
| Median of Two Sorted Arrays | Hard | 45.9% | 50.0% | ArrayBinary SearchDivide and Conquer |
| Immediate Food Delivery II | Medium | 55.6% | 50.0% | Database |
| Letter Combinations of a Phone Number | Medium | 65.5% | 50.0% | Hash TableStringBacktracking |
| Maximum Score From Removing Substrings | Medium | 66.6% | 50.0% | StringStackGreedy |
| K Closest Points to Origin | Medium | 68.7% | 50.0% | ArrayMathDivide and Conquer+4 |
| Minimum Number of Work Sessions to Finish the Tasks | Medium | 34.5% | 50.0% | ArrayDynamic ProgrammingBacktracking+2 |
| Two City Scheduling | Medium | 68.3% | 50.0% | ArrayGreedySorting |
| Continuous Subarray Sum | Medium | 31.2% | 50.0% | ArrayHash TableMath+1 |
| Trapping Rain Water | Hard | 66.8% | 50.0% | ArrayTwo PointersDynamic Programming+2 |
| Minimum Window Substring | Hard | 46.9% | 50.0% | Hash TableStringSliding Window |
| Maximum Product Subarray | Medium | 36.0% | 50.0% | ArrayDynamic Programming |
| Sum of Two Integers | Medium | 55.0% | 50.0% | MathBit Manipulation |
| LRU Cache | Medium | 46.8% | 50.0% | Hash TableLinked ListDesign+1 |
| Maximum Subarray | Medium | 53.0% | 50.0% | ArrayDivide and ConquerDynamic Programming |
| Two Sum | Easy | 57.1% | 50.0% | ArrayHash Table |
| Koko Eating Bananas | Medium | 49.7% | 50.0% | ArrayBinary Search |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 50.0% | Hash TableStringSliding Window |
| Maximum Length of Pair Chain | Medium | 61.5% | 50.0% | ArrayDynamic ProgrammingGreedy+1 |
| Distinct Subsequences | Hard | 51.5% | 50.0% | StringDynamic Programming |
| Count Days Without Meetings | Medium | 48.1% | 50.0% | ArraySorting |
| Longest Palindromic Substring | Medium | 37.3% | 50.0% | Two PointersStringDynamic Programming |
| Design Twitter | Medium | 44.2% | 50.0% | Hash TableLinked ListDesign+1 |