| Walls and Gates | Medium | 63.8% | 100.0% | ArrayBreadth-First SearchMatrix |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 92.5% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 91.4% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Search Suggestions System | Medium | 65.1% | 82.2% | ArrayStringBinary Search+3 |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 78.1% | ArrayBinary SearchDynamic Programming+1 |
| Koko Eating Bananas | Medium | 49.7% | 75.6% | ArrayBinary Search |
| Single-Threaded CPU | Medium | 47.4% | 75.1% | ArraySortingHeap (Priority Queue) |
| Design File System | Medium | 65.1% | 72.1% | Hash TableStringDesign+1 |
| Shortest Distance from All Buildings | Hard | 44.9% | 70.7% | ArrayBreadth-First SearchMatrix |
| Check if One String Swap Can Make Strings Equal | Easy | 49.5% | 66.8% | Hash TableStringCounting |
| Most Profit Assigning Work | Medium | 56.1% | 65.9% | ArrayTwo PointersBinary Search+2 |
| Design In-Memory File System | Hard | 48.4% | 65.0% | Hash TableStringDesign+2 |
| Buddy Strings | Easy | 33.9% | 65.0% | Hash TableString |
| Next Greater Element III | Medium | 35.2% | 65.0% | MathTwo PointersString |
| Find K Closest Elements | Medium | 49.4% | 64.0% | ArrayTwo PointersBinary Search+3 |
| Minimum Number of Steps to Make Two Strings Anagram | Medium | 82.5% | 64.0% | Hash TableStringCounting |
| Making A Large Island | Hard | 56.3% | 61.8% | ArrayDepth-First SearchBreadth-First Search+2 |
| Basic Calculator III | Hard | 53.2% | 60.5% | MathStringStack+1 |
| Count Nodes With the Highest Score | Medium | 52.5% | 59.2% | ArrayTreeDepth-First Search+1 |
| Count All Valid Pickup and Delivery Options | Hard | 64.9% | 57.8% | MathDynamic ProgrammingCombinatorics |
| Interval List Intersections | Medium | 72.9% | 54.6% | ArrayTwo PointersSweep Line |
| Mice and Cheese | Medium | 48.3% | 54.6% | ArrayGreedySorting+1 |
| Immediate Food Delivery I | Easy | 80.7% | 54.6% | Database |
| Immediate Food Delivery II | Medium | 55.7% | 54.6% | Database |
| Subsequence With the Minimum Score | Hard | 33.2% | 54.6% | Two PointersStringBinary Search |
| Find Nearest Point That Has the Same X or Y Coordinate | Easy | 69.9% | 52.8% | Array |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 50.7% | Hash TableTreeDepth-First Search+3 |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 50.7% | Hash TableStringDesign+1 |
| 01 Matrix | Medium | 53.4% | 50.7% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Course Schedule II | Medium | 55.0% | 50.7% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| 132 Pattern | Medium | 34.5% | 48.4% | ArrayBinary SearchStack+2 |
| Next Permutation | Medium | 44.8% | 48.4% | ArrayTwo Pointers |
| Largest Rectangle in Histogram | Hard | 49.4% | 48.4% | ArrayStackMonotonic Stack |
| Basic Calculator | Hard | 46.6% | 48.4% | MathStringStack+1 |
| Max Area of Island | Medium | 73.8% | 48.4% | ArrayDepth-First SearchBreadth-First Search+2 |
| Minimum Size Subarray Sum | Medium | 51.1% | 48.4% | ArrayBinary SearchSliding Window+1 |
| Two Sum | Easy | 57.1% | 48.4% | ArrayHash Table |
| Basic Calculator II | Medium | 46.7% | 45.7% | MathStringStack |
| Serialize and Deserialize Binary Tree | Hard | 60.4% | 45.7% | StringTreeDepth-First Search+3 |
| Longest Common Subsequence | Medium | 58.9% | 45.7% | StringDynamic Programming |
| Asteroid Collision | Medium | 47.2% | 42.5% | ArrayStackSimulation |
| Best Meeting Point | Hard | 61.4% | 42.5% | ArrayMathSorting+1 |
| Word Search II | Hard | 38.1% | 42.5% | ArrayStringBacktracking+2 |
| Sliding Window Maximum | Hard | 48.5% | 38.6% | ArrayQueueSliding Window+2 |
| Number of Islands | Medium | 63.8% | 38.6% | ArrayDepth-First SearchBreadth-First Search+2 |
| Ways to Make a Fair Array | Medium | 66.4% | 38.6% | ArrayPrefix Sum |
| Minimize Malware Spread | Hard | 43.0% | 38.6% | ArrayHash TableDepth-First Search+3 |
| Sliding Window Median | Hard | 38.9% | 38.6% | ArrayHash TableSliding Window+1 |
| Course Schedule | Medium | 50.8% | 38.6% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Shortest Path to Get Food | Medium | 57.1% | 38.6% | ArrayBreadth-First SearchMatrix |
| Sudoku Solver | Hard | 65.4% | 33.6% | ArrayHash TableBacktracking+1 |
| Jump Game | Medium | 40.5% | 33.6% | ArrayDynamic ProgrammingGreedy |
| Swim in Rising Water | Hard | 67.6% | 33.6% | ArrayBinary SearchDepth-First Search+4 |
| Count Sub Islands | Medium | 73.0% | 33.6% | ArrayDepth-First SearchBreadth-First Search+2 |
| Binary Tree Vertical Order Traversal | Medium | 57.8% | 33.6% | Hash TableTreeDepth-First Search+3 |
| LRU Cache | Medium | 46.8% | 33.6% | Hash TableLinked ListDesign+1 |
| 4Sum | Medium | 40.0% | 33.6% | ArrayTwo PointersSorting |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 33.6% | ArrayHash TableMath+2 |
| Merge k Sorted Lists | Hard | 58.9% | 33.6% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Similar String Groups | Hard | 56.1% | 33.6% | ArrayHash TableString+3 |
| Integer to Roman | Medium | 70.5% | 33.6% | Hash TableMathString |
| Merge Intervals | Medium | 51.2% | 33.6% | ArraySorting |
| Jump Game II | Medium | 42.5% | 26.7% | ArrayDynamic ProgrammingGreedy |
| Design Add and Search Words Data Structure | Medium | 48.2% | 26.7% | StringDepth-First SearchDesign+1 |
| Number of Visible People in a Queue | Hard | 72.4% | 26.7% | ArrayStackMonotonic Stack |
| Maximum Gap | Medium | 51.4% | 26.7% | ArraySortingBucket Sort+1 |
| Maximum Path Quality of a Graph | Hard | 61.7% | 26.7% | ArrayBacktrackingGraph Theory |
| LFU Cache | Hard | 48.6% | 26.7% | Hash TableLinked ListDesign+1 |
| Design Browser History | Medium | 78.2% | 26.7% | ArrayLinked ListStack+3 |
| Group Anagrams | Medium | 72.2% | 26.7% | ArrayHash TableString+1 |
| Brace Expansion | Medium | 66.8% | 26.7% | StringBacktrackingStack+2 |
| Range Sum Query 2D - Immutable | Medium | 57.9% | 26.7% | ArrayDesignMatrix+1 |
| Longest Palindromic Substring | Medium | 37.4% | 26.7% | Two PointersStringDynamic Programming |
| Roman to Integer | Easy | 66.3% | 26.7% | Hash TableMathString |
| Find Edges in Shortest Paths | Hard | 46.4% | 26.7% | Depth-First SearchBreadth-First SearchGraph Theory+2 |
| Diameter of Binary Tree | Easy | 65.1% | 26.7% | TreeDepth-First SearchBinary Tree |
| Rotting Oranges | Medium | 58.2% | 26.7% | ArrayBreadth-First SearchMatrix |
| Add Two Numbers | Medium | 48.0% | 26.7% | Linked ListMathRecursion |