| Walls and Gates | Medium | 63.8% | 100.0% | |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 87.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Longest Increasing Path in a Matrix | Hard | 56.3% | 87.5% | ArrayDynamic ProgrammingDepth-First Search+5 |
| Search Suggestions System | Medium | 65.2% | 87.5% | ArrayStringBinary Search+3 |
| Design File System | Medium | 65.1% | 75.0% | |
| Shortest Distance from All Buildings | Hard | 44.8% | 75.0% | |
| Maximum Profit in Job Scheduling | Hard | 54.6% | 75.0% | ArrayBinary SearchDynamic Programming+1 |
| Most Profit Assigning Work | Medium | 56.1% | 75.0% | ArrayTwo PointersBinary Search+2 |
| Check if One String Swap Can Make Strings Equal | Easy | 49.5% | 75.0% | Hash TableStringCounting |
| Koko Eating Bananas | Medium | 49.7% | 75.0% | ArrayBinary Search |
| Single-Threaded CPU | Medium | 47.3% | 75.0% | ArraySortingHeap (Priority Queue) |
| Count Nodes With the Highest Score | Medium | 52.5% | 62.5% | ArrayTreeDepth-First Search+1 |
| Minimum Number of Steps to Make Two Strings Anagram | Medium | 82.5% | 62.5% | Hash TableStringCounting |
| Next Greater Element III | Medium | 35.1% | 62.5% | MathTwo PointersString |
| Design In-Memory File System | Hard | 48.4% | 62.5% | |
| Find K Closest Elements | Medium | 49.4% | 62.5% | ArrayTwo PointersBinary Search+3 |
| Asteroid Collision | Medium | 47.1% | 62.5% | ArrayStackSimulation |
| Basic Calculator III | Hard | 53.1% | 62.5% | |
| Making A Large Island | Hard | 56.3% | 62.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Find Nearest Point That Has the Same X or Y Coordinate | Easy | 69.9% | 62.5% | Array |
| Buddy Strings | Easy | 33.9% | 62.5% | Hash TableString |
| Two Sum | Easy | 57.1% | 50.0% | ArrayHash Table |
| Interval List Intersections | Medium | 72.9% | 50.0% | ArrayTwo PointersSweep Line |
| Vertical Order Traversal of a Binary Tree | Hard | 53.2% | 50.0% | Hash TableTreeDepth-First Search+3 |
| Next Permutation | Medium | 44.7% | 50.0% | ArrayTwo Pointers |
| Largest Rectangle in Histogram | Hard | 49.3% | 50.0% | ArrayStackMonotonic Stack |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 50.0% | Hash TableStringDesign+1 |
| Course Schedule II | Medium | 55.0% | 50.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Word Search II | Hard | 38.1% | 50.0% | ArrayStringBacktracking+2 |
| Basic Calculator | Hard | 46.5% | 50.0% | MathStringStack+1 |
| Longest Common Subsequence | Medium | 58.9% | 50.0% | StringDynamic Programming |
| Basic Calculator II | Medium | 46.6% | 50.0% | MathStringStack |
| Immediate Food Delivery I | Easy | 80.7% | 50.0% | |
| Immediate Food Delivery II | Medium | 55.6% | 50.0% | Database |
| Best Meeting Point | Hard | 61.4% | 50.0% | |
| Serialize and Deserialize Binary Tree | Hard | 60.3% | 50.0% | StringTreeDepth-First Search+3 |
| Count All Valid Pickup and Delivery Options | Hard | 64.9% | 50.0% | MathDynamic ProgrammingCombinatorics |
| Subsequence With the Minimum Score | Hard | 33.1% | 50.0% | Two PointersStringBinary Search |
| Mice and Cheese | Medium | 48.2% | 50.0% | ArrayGreedySorting+1 |
| Count Sub Islands | Medium | 73.0% | 50.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Max Area of Island | Medium | 73.8% | 50.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| 01 Matrix | Medium | 53.3% | 50.0% | ArrayDynamic ProgrammingBreadth-First Search+1 |
| Minimum Size Subarray Sum | Medium | 51.0% | 50.0% | ArrayBinary SearchSliding Window+1 |
| Sudoku Solver | Hard | 65.4% | 37.5% | ArrayHash TableBacktracking+1 |
| Jump Game | Medium | 40.5% | 37.5% | ArrayDynamic ProgrammingGreedy |
| Maximum Path Quality of a Graph | Hard | 61.6% | 37.5% | ArrayBacktrackingGraph Theory |
| LRU Cache | Medium | 46.8% | 37.5% | Hash TableLinked ListDesign+1 |
| Number of Islands | Medium | 63.8% | 37.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Design Add and Search Words Data Structure | Medium | 48.1% | 37.5% | StringDepth-First SearchDesign+1 |
| Sliding Window Maximum | Hard | 48.4% | 37.5% | ArrayQueueSliding Window+2 |
| Number of Visible People in a Queue | Hard | 72.3% | 37.5% | ArrayStackMonotonic Stack |
| Shortest Path to Get Food | Medium | 57.1% | 37.5% | |
| Task Scheduler | Medium | 62.6% | 37.5% | ArrayHash TableGreedy+3 |
| Swim in Rising Water | Hard | 67.6% | 37.5% | ArrayBinary SearchDepth-First Search+4 |
| LFU Cache | Hard | 48.6% | 37.5% | Hash TableLinked ListDesign+1 |
| Binary Tree Vertical Order Traversal | Medium | 57.7% | 37.5% | |
| Ways to Make a Fair Array | Medium | 66.3% | 37.5% | ArrayPrefix Sum |
| Brace Expansion | Medium | 66.8% | 37.5% | |
| Minimize Malware Spread | Hard | 42.9% | 37.5% | ArrayHash TableDepth-First Search+3 |
| Sliding Window Median | Hard | 38.9% | 37.5% | ArrayHash TableSliding Window+1 |
| 4Sum | Medium | 40.0% | 37.5% | ArrayTwo PointersSorting |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 37.5% | ArrayHash TableMath+2 |
| Merge k Sorted Lists | Hard | 58.8% | 37.5% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Similar String Groups | Hard | 56.1% | 37.5% | ArrayHash TableString+3 |
| Course Schedule | Medium | 50.8% | 37.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Integer to Roman | Medium | 70.4% | 37.5% | Hash TableMathString |
| Merge Intervals | Medium | 51.1% | 37.5% | ArraySorting |
| 132 Pattern | Medium | 34.5% | 37.5% | ArrayBinary SearchStack+2 |
| Jump Game II | Medium | 42.4% | 25.0% | ArrayDynamic ProgrammingGreedy |
| Maximum Gap | Medium | 51.4% | 25.0% | ArraySortingBucket Sort+1 |
| Maximum Performance of a Team | Hard | 47.7% | 25.0% | ArrayGreedySorting+1 |
| Diameter of N-Ary Tree | Medium | 75.4% | 25.0% | |
| Design Browser History | Medium | 78.2% | 25.0% | ArrayLinked ListStack+3 |
| Top K Frequent Elements | Medium | 65.8% | 25.0% | ArrayHash TableDivide and Conquer+5 |
| Employee Free Time | Hard | 72.8% | 25.0% | |
| Analyze User Website Visit Pattern | Medium | 44.2% | 25.0% | |
| Group Anagrams | Medium | 72.2% | 25.0% | ArrayHash TableString+1 |
| Task Scheduler II | Medium | 54.7% | 25.0% | ArrayHash TableSimulation |
| Number of Closed Islands | Medium | 67.0% | 25.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Range Sum Query 2D - Immutable | Medium | 57.8% | 25.0% | ArrayDesignMatrix+1 |
| Longest Palindromic Substring | Medium | 37.3% | 25.0% | Two PointersStringDynamic Programming |
| Design Search Autocomplete System | Hard | 49.7% | 25.0% | |
| K-Similar Strings | Hard | 40.6% | 25.0% | Hash TableStringBreadth-First Search |
| Roman to Integer | Easy | 66.2% | 25.0% | Hash TableMathString |
| Find Edges in Shortest Paths | Hard | 46.4% | 25.0% | Depth-First SearchBreadth-First SearchGraph Theory+2 |
| Rotting Oranges | Medium | 58.1% | 25.0% | ArrayBreadth-First SearchMatrix |
| Add Two Numbers | Medium | 47.9% | 25.0% | Linked ListMathRecursion |