| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Meeting Rooms II | Medium | 52.5% | 100.0% | |
| Valid Sudoku | Medium | 64.1% | 87.5% | ArrayHash TableMatrix |
| Sudoku Solver | Hard | 65.4% | 87.5% | ArrayHash TableBacktracking+1 |
| Combination Sum | Medium | 76.1% | 87.5% | ArrayBacktracking |
| Combination Sum II | Medium | 59.0% | 87.5% | ArrayBacktracking |
| Wildcard Matching | Hard | 31.3% | 87.5% | StringDynamic ProgrammingGreedy+1 |
| Minimum Window Substring | Hard | 46.9% | 87.5% | Hash TableStringSliding Window |
| Unique Binary Search Trees | Medium | 63.3% | 87.5% | MathDynamic ProgrammingTree+2 |
| Word Ladder | Hard | 44.9% | 87.5% | Hash TableStringBreadth-First Search |
| Word Break II | Hard | 55.1% | 87.5% | ArrayHash TableString+4 |
| Reverse Words in a String | Medium | 55.5% | 87.5% | Two PointersString |
| Min Stack | Medium | 57.7% | 87.5% | StackDesign |
| One Edit Distance | Medium | 34.5% | 87.5% | |
| Number of Islands | Medium | 63.8% | 87.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Reverse Linked List | Easy | 80.2% | 87.5% | Linked ListRecursion |
| Basic Calculator II | Medium | 46.6% | 87.5% | MathStringStack |
| Alien Dictionary | Hard | 37.1% | 87.5% | |
| Closest Binary Search Tree Value | Easy | 49.3% | 87.5% | |
| Game of Life | Medium | 72.3% | 87.5% | ArrayMatrixSimulation |
| Burst Balloons | Hard | 62.9% | 87.5% | ArrayDynamic Programming |
| Binary Tree Vertical Order Traversal | Medium | 57.7% | 87.5% | |
| Combination Sum IV | Medium | 55.0% | 87.5% | ArrayDynamic Programming |
| Remove K Digits | Medium | 36.4% | 87.5% | StringStackGreedy+1 |
| Frog Jump | Hard | 47.1% | 87.5% | ArrayDynamic Programming |
| Ternary Expression Parser | Medium | 62.5% | 87.5% | |
| String Compression | Medium | 59.5% | 87.5% | Two PointersString |
| Word Abbreviation | Hard | 62.7% | 87.5% | |
| Design Log Storage System | Medium | 59.2% | 87.5% | |
| Largest Merge Of Two Strings | Medium | 53.4% | 87.5% | Two PointersStringGreedy |
| Least Operators to Express Number | Hard | 48.6% | 87.5% | MathDynamic ProgrammingMemoization |
| Making A Large Island | Hard | 56.3% | 87.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Bus Routes | Hard | 47.1% | 87.5% | ArrayHash TableBreadth-First Search |
| Number of Distinct Islands | Medium | 62.7% | 87.5% | |
| Bricks Falling When Hit | Hard | 36.9% | 87.5% | ArrayUnion-FindMatrix |
| Course Schedule | Medium | 50.8% | 75.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Course Schedule II | Medium | 55.0% | 75.0% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Merge Intervals | Medium | 51.1% | 62.5% | ArraySorting |
| Best Time to Buy and Sell Stock III | Hard | 53.1% | 62.5% | ArrayDynamic Programming |
| Top K Frequent Elements | Medium | 65.8% | 62.5% | ArrayHash TableDivide and Conquer+5 |
| Evaluate Division | Medium | 64.0% | 62.5% | ArrayStringDepth-First Search+4 |
| Basic Calculator III | Hard | 53.1% | 62.5% | |
| Minimum Area Rectangle | Medium | 55.3% | 62.5% | ArrayHash TableMath+2 |
| Minimum Number of Keypresses | Medium | 71.4% | 62.5% | |
| Decode Ways | Medium | 37.6% | 62.5% | StringDynamic Programming |
| Best Meeting Point | Hard | 61.4% | 62.5% | |
| Median of Two Sorted Arrays | Hard | 45.9% | 50.0% | ArrayBinary SearchDivide and Conquer |
| Word Search | Medium | 46.8% | 50.0% | ArrayStringBacktracking+2 |
| Power of Two | Easy | 49.8% | 50.0% | MathBit ManipulationRecursion |
| Search a 2D Matrix II | Medium | 56.8% | 50.0% | ArrayBinary SearchDivide and Conquer+1 |
| Minimum Remove to Make Valid Parentheses | Medium | 71.3% | 50.0% | StringStack |
| Insert Delete GetRandom O(1) | Medium | 55.3% | 50.0% | ArrayHash TableMath+2 |
| Shortest Path in a Grid with Obstacles Elimination | Hard | 46.1% | 50.0% | ArrayBreadth-First SearchMatrix |
| Amount of Time for Binary Tree to Be Infected | Medium | 65.1% | 50.0% | Hash TableTreeDepth-First Search+2 |
| Design Browser History | Medium | 78.2% | 50.0% | ArrayLinked ListStack+3 |
| Design a Text Editor | Hard | 49.9% | 50.0% | Linked ListStringStack+3 |
| Minimum Time to Complete All Tasks | Hard | 39.6% | 50.0% | ArrayBinary SearchStack+2 |
| Product of Array Except Self | Medium | 68.6% | 50.0% | ArrayPrefix Sum |
| Reorder List | Medium | 64.6% | 50.0% | Linked ListTwo PointersStack+1 |
| Word Search II | Hard | 38.1% | 50.0% | ArrayStringBacktracking+2 |
| LFU Cache | Hard | 48.6% | 50.0% | Hash TableLinked ListDesign+1 |
| Reaching Points | Hard | 34.2% | 50.0% | Math |
| Basic Calculator | Hard | 46.5% | 50.0% | MathStringStack+1 |
| Count Unreachable Pairs of Nodes in an Undirected Graph | Medium | 49.8% | 50.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Escape the Spreading Fire | Hard | 37.6% | 50.0% | ArrayBinary SearchBreadth-First Search+1 |
| Edit Distance | Medium | 60.1% | 37.5% | StringDynamic Programming |
| Binary Tree Maximum Path Sum | Hard | 42.0% | 37.5% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Valid Arrangement of Pairs | Hard | 66.5% | 37.5% | ArrayDepth-First SearchGraph Theory+1 |
| Search Suggestions System | Medium | 65.2% | 37.5% | ArrayStringBinary Search+3 |
| Accounts Merge | Medium | 60.9% | 37.5% | ArrayHash TableString+4 |
| Cheapest Flights Within K Stops | Medium | 41.4% | 37.5% | Dynamic ProgrammingDepth-First SearchBreadth-First Search+3 |
| Score of Parentheses | Medium | 63.6% | 37.5% | StringStack |
| Random Pick with Weight | Medium | 48.9% | 37.5% | ArrayMathBinary Search+2 |
| Custom Sort String | Medium | 72.3% | 37.5% | Hash TableStringSorting |
| Group Anagrams | Medium | 72.2% | 37.5% | ArrayHash TableString+1 |
| Car Fleet | Medium | 54.7% | 37.5% | ArrayStackSorting+1 |
| K Closest Points to Origin | Medium | 68.7% | 37.5% | ArrayMathDivide and Conquer+4 |
| The Maze | Medium | 60.3% | 37.5% | |
| Search in Rotated Sorted Array | Medium | 44.1% | 37.5% | ArrayBinary Search |
| Shortest Path in Binary Matrix | Medium | 51.1% | 37.5% | ArrayBreadth-First SearchMatrix |
| Minimum Number of Pushes to Type Word I | Easy | 66.9% | 37.5% | MathStringGreedy |
| Letter Combinations of a Phone Number | Medium | 65.5% | 37.5% | Hash TableStringBacktracking |
| Snapshot Array | Medium | 36.7% | 37.5% | ArrayHash TableBinary Search+1 |
| Add Binary | Easy | 57.6% | 37.5% | MathStringBit Manipulation+1 |
| Number of Ways to Form a Target String Given a Dictionary | Hard | 56.6% | 37.5% | ArrayStringDynamic Programming |
| Design Add and Search Words Data Structure | Medium | 48.1% | 37.5% | StringDepth-First SearchDesign+1 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 37.5% | Hash TableStringSliding Window |
| Open the Lock | Medium | 61.1% | 37.5% | ArrayHash TableString+1 |
| Minimum Path Sum | Medium | 67.8% | 37.5% | ArrayDynamic ProgrammingMatrix |
| Number of Submatrices That Sum to Target | Hard | 74.6% | 37.5% | ArrayHash TableMatrix+1 |
| UTF-8 Validation | Medium | 46.0% | 37.5% | ArrayBit Manipulation |
| Find All Anagrams in a String | Medium | 53.3% | 37.5% | Hash TableStringSliding Window |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 37.5% | ArrayDynamic Programming |
| Koko Eating Bananas | Medium | 49.7% | 37.5% | ArrayBinary Search |
| Sliding Window Median | Hard | 38.9% | 37.5% | ArrayHash TableSliding Window+1 |
| Reconstruct Itinerary | Hard | 44.3% | 37.5% | ArrayStringDepth-First Search+4 |
| Maximum Swap | Medium | 51.9% | 37.5% | MathGreedy |
| Task Scheduler | Medium | 62.6% | 37.5% | ArrayHash TableGreedy+3 |
| Possible Bipartition | Medium | 52.3% | 37.5% | Depth-First SearchBreadth-First SearchUnion-Find+1 |