| 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% | 95.5% | ArrayPrefix Sum |
| Count Good Meals | Medium | 32.6% | 93.0% | ArrayHash Table |
| Next Greater Element I | Easy | 75.8% | 78.6% | ArrayHash TableStack+1 |
| Happy Number | Easy | 59.3% | 78.6% | Hash TableMathTwo Pointers |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 73.1% | ArrayDynamic Programming |
| Course Schedule | Medium | 50.8% | 73.1% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Edit Distance | Medium | 60.2% | 73.1% | StringDynamic Programming |
| Count Days Without Meetings | Medium | 48.1% | 66.1% | ArraySorting |
| Unique Binary Search Trees | Medium | 63.3% | 66.1% | MathDynamic ProgrammingTree+2 |
| Merge Sorted Array | Easy | 54.4% | 66.1% | ArrayTwo PointersSorting |
| Integer to Roman | Medium | 70.5% | 66.1% | Hash TableMathString |
| Daily Temperatures | Medium | 68.4% | 66.1% | ArrayStackMonotonic Stack |
| Fair Candy Swap | Easy | 64.6% | 66.1% | ArrayHash TableBinary Search+1 |
| Distinct Subsequences | Hard | 51.5% | 66.1% | StringDynamic Programming |
| Minimum Window Substring | Hard | 47.0% | 66.1% | Hash TableStringSliding Window |
| Longest Consecutive Sequence | Medium | 47.0% | 66.1% | ArrayHash TableUnion-Find |
| Koko Eating Bananas | Medium | 49.7% | 66.1% | ArrayBinary Search |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 56.2% | ArrayBinary SearchDynamic Programming+1 |
| Sort Colors | Medium | 69.2% | 56.2% | ArrayTwo PointersSorting |
| Median of Two Sorted Arrays | Hard | 46.0% | 56.2% | ArrayBinary SearchDivide and Conquer |
| Subarray Sum Equals K | Medium | 46.8% | 56.2% | ArrayHash TablePrefix Sum |
| Immediate Food Delivery II | Medium | 55.7% | 56.2% | Database |
| Maximum Score From Removing Substrings | Medium | 66.6% | 56.2% | StringStackGreedy |
| LRU Cache | Medium | 46.8% | 56.2% | Hash TableLinked ListDesign+1 |
| K Closest Points to Origin | Medium | 68.8% | 56.2% | ArrayMathDivide and Conquer+4 |
| Minimum Number of Work Sessions to Finish the Tasks | Medium | 34.6% | 56.2% | ArrayDynamic ProgrammingBacktracking+2 |
| Two City Scheduling | Medium | 68.4% | 56.2% | ArrayGreedySorting |
| Sum of Two Integers | Medium | 55.1% | 56.2% | MathBit Manipulation |
| Trapping Rain Water | Hard | 66.8% | 56.2% | ArrayTwo PointersDynamic Programming+2 |
| Maximum Subarray | Medium | 53.0% | 56.2% | ArrayDivide and ConquerDynamic Programming |
| Longest Palindromic Substring | Medium | 37.4% | 56.2% | Two PointersStringDynamic Programming |
| Maximum Product Subarray | Medium | 36.0% | 56.2% | ArrayDynamic Programming |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 56.2% | Hash TableStringSliding Window |
| First Missing Positive | Hard | 42.5% | 56.2% | ArrayHash Table |
| Design Twitter | Medium | 44.2% | 56.2% | Hash TableLinked ListDesign+1 |