| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Meeting Rooms II | Medium | 52.6% | 95.9% | ArrayTwo PointersGreedy+3 |
| Number of Islands | Medium | 63.8% | 94.4% | ArrayDepth-First SearchBreadth-First Search+2 |
| Word Ladder | Hard | 44.9% | 92.8% | Hash TableStringBreadth-First Search |
| Minimum Window Substring | Hard | 47.0% | 92.8% | Hash TableStringSliding Window |
| Design Log Storage System | Medium | 59.3% | 91.1% | Hash TableStringDesign+1 |
| Making A Large Island | Hard | 56.3% | 89.3% | ArrayDepth-First SearchBreadth-First Search+2 |
| Number of Distinct Islands | Medium | 62.7% | 89.3% | ArrayHash TableDepth-First Search+5 |
| Bus Routes | Hard | 47.1% | 87.3% | ArrayHash TableBreadth-First Search |
| Word Break II | Hard | 55.1% | 87.3% | ArrayHash TableString+4 |
| Basic Calculator II | Medium | 46.7% | 85.1% | MathStringStack |
| Combination Sum | Medium | 76.1% | 85.1% | ArrayBacktracking |
| Reverse Words in a String | Medium | 55.6% | 85.1% | Two PointersString |
| Bricks Falling When Hit | Hard | 36.9% | 82.7% | ArrayUnion-FindMatrix |
| Alien Dictionary | Hard | 37.1% | 82.7% | ArrayStringDepth-First Search+3 |
| Closest Binary Search Tree Value | Easy | 49.3% | 82.7% | Binary SearchTreeDepth-First Search+2 |
| Word Abbreviation | Hard | 62.7% | 82.7% | ArrayStringGreedy+2 |
| Remove K Digits | Medium | 36.4% | 82.7% | StringStackGreedy+1 |
| Frog Jump | Hard | 47.1% | 82.7% | ArrayDynamic Programming |
| Min Stack | Medium | 57.7% | 82.7% | StackDesign |
| One Edit Distance | Medium | 34.6% | 82.7% | Two PointersString |
| Game of Life | Medium | 72.4% | 82.7% | ArrayMatrixSimulation |
| Valid Sudoku | Medium | 64.2% | 82.7% | ArrayHash TableMatrix |
| Sudoku Solver | Hard | 65.4% | 82.7% | ArrayHash TableBacktracking+1 |
| Combination Sum II | Medium | 59.0% | 82.7% | ArrayBacktracking |
| Wildcard Matching | Hard | 31.4% | 82.7% | StringDynamic ProgrammingGreedy+1 |
| Ternary Expression Parser | Medium | 62.5% | 82.7% | StringStackRecursion |
| Burst Balloons | Hard | 63.0% | 82.7% | ArrayDynamic Programming |
| Binary Tree Vertical Order Traversal | Medium | 57.8% | 82.7% | Hash TableTreeDepth-First Search+3 |
| String Compression | Medium | 59.6% | 82.7% | Two PointersString |
| Reverse Linked List | Easy | 80.3% | 82.7% | Linked ListRecursion |
| Largest Merge Of Two Strings | Medium | 53.5% | 82.7% | Two PointersStringGreedy |
| Unique Binary Search Trees | Medium | 63.3% | 82.7% | MathDynamic ProgrammingTree+2 |
| Least Operators to Express Number | Hard | 48.7% | 82.7% | MathDynamic ProgrammingMemoization |
| Combination Sum IV | Medium | 55.0% | 82.7% | ArrayDynamic Programming |
| Top K Frequent Elements | Medium | 65.9% | 77.2% | ArrayHash TableDivide and Conquer+5 |
| Course Schedule II | Medium | 55.0% | 77.2% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Decode Ways | Medium | 37.6% | 65.5% | StringDynamic Programming |
| Best Meeting Point | Hard | 61.4% | 65.5% | ArrayMathSorting+1 |
| Best Time to Buy and Sell Stock III | Hard | 53.2% | 65.5% | ArrayDynamic Programming |
| Basic Calculator III | Hard | 53.2% | 59.9% | MathStringStack+1 |
| Escape the Spreading Fire | Hard | 37.6% | 59.9% | ArrayBinary SearchBreadth-First Search+1 |
| Evaluate Division | Medium | 64.0% | 59.9% | ArrayStringDepth-First Search+4 |
| Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | 49.8% | 59.9% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Minimum Area Rectangle | Medium | 55.3% | 52.8% | ArrayHash TableMath+2 |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 52.8% | ArrayBreadth-First SearchMatrix |
| Course Schedule | Medium | 50.8% | 52.8% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Merge Intervals | Medium | 51.2% | 52.8% | ArraySorting |
| Reorder List | Medium | 64.6% | 52.8% | Linked ListTwo PointersStack+1 |
| Word Search II | Hard | 38.1% | 52.8% | ArrayStringBacktracking+2 |
| Basic Calculator | Hard | 46.6% | 52.8% | MathStringStack+1 |
| LFU Cache | Hard | 48.6% | 52.8% | Hash TableLinked ListDesign+1 |
| Reaching Points | Hard | 34.2% | 52.8% | Math |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 52.8% | StringStack |
| Power of Two | Easy | 49.9% | 52.8% | MathBit ManipulationRecursion |
| Group Anagrams | Medium | 72.2% | 52.8% | ArrayHash TableString+1 |
| Open the Lock | Medium | 61.2% | 52.8% | ArrayHash TableString+1 |
| Merge k Sorted Lists | Hard | 58.9% | 42.9% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Design Hit Counter | Medium | 69.6% | 42.9% | ArrayBinary SearchDesign+2 |
| Word Search | Medium | 46.9% | 42.9% | ArrayStringBacktracking+2 |
| Shortest Path in Binary Matrix | Medium | 51.1% | 42.9% | ArrayBreadth-First SearchMatrix |
| Product of Array Except Self | Medium | 68.6% | 42.9% | ArrayPrefix Sum |
| Snapshot Array | Medium | 36.7% | 42.9% | ArrayHash TableBinary Search+1 |
| Minimum Number of Pushes to Type Word I | Easy | 66.9% | 42.9% | MathStringGreedy |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 42.9% | Dynamic ProgrammingTreeDepth-First Search+1 |
| The Maze | Medium | 60.3% | 42.9% | ArrayDepth-First SearchBreadth-First Search+1 |
| Letter Combinations of a Phone Number | Medium | 65.5% | 42.9% | Hash TableStringBacktracking |
| Add Binary | Easy | 57.7% | 42.9% | MathStringBit Manipulation+1 |
| Search in Rotated Sorted Array | Medium | 44.1% | 42.9% | ArrayBinary Search |
| K Closest Points to Origin | Medium | 68.8% | 42.9% | ArrayMathDivide and Conquer+4 |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 42.9% | ArrayStringDynamic Programming |
| UTF-8 Validation | Medium | 46.1% | 42.9% | ArrayBit Manipulation |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 42.9% | Hash TableStringSliding Window |
| Cheapest Flights Within K Stops | Medium | 41.4% | 42.9% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Random Pick with Weight | Medium | 48.9% | 42.9% | ArrayMathBinary Search+2 |
| Minimum Path Sum | Medium | 67.8% | 42.9% | ArrayDynamic ProgrammingMatrix |
| Number of Submatrices That Sum to Target | Hard | 74.6% | 42.9% | ArrayHash TableMatrix+1 |
| Design Browser History | Medium | 78.2% | 42.9% | ArrayLinked ListStack+3 |
| Koko Eating Bananas | Medium | 49.7% | 42.9% | ArrayBinary Search |
| Sliding Window Median | Hard | 38.9% | 42.9% | ArrayHash TableSliding Window+1 |
| Design Add and Search Words Data Structure | Medium | 48.2% | 42.9% | StringDepth-First SearchDesign+1 |
| Possible Bipartition | Medium | 52.4% | 42.9% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Most Stones Removed with Same Row or Column | Medium | 62.7% | 42.9% | Hash TableDepth-First SearchUnion-Find+1 |
| Fraction to Recurring Decimal | Medium | 30.6% | 42.9% | Hash TableMathString |
