| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Remove One Element to Make the Array Strictly Increasing | Easy | 29.6% | 100.0% | Array |
| Alternating Digit Sum | Easy | 69.0% | 95.7% | Math |
| Partition Equal Subset Sum | Medium | 49.2% | 93.2% | ArrayDynamic Programming |
| Binary Gap | Easy | 74.1% | 93.2% | Bit Manipulation |
| Minimize Maximum Pair Sum in Array | Medium | 83.3% | 93.2% | ArrayTwo PointersGreedy+1 |
| Minimum Window Subsequence | Hard | 43.8% | 93.2% | StringDynamic ProgrammingSliding Window |
| Design Skiplist | Hard | 59.5% | 93.2% | Linked ListDesign |
| Subtree of Another Tree | Easy | 51.3% | 93.2% | TreeDepth-First SearchString Matching+2 |
| Two Sum | Easy | 57.1% | 87.4% | ArrayHash Table |
| Spiral Matrix | Medium | 56.2% | 87.4% | ArrayMatrixSimulation |
| Top K Frequent Elements | Medium | 65.9% | 79.9% | ArrayHash TableDivide and Conquer+5 |
| Open the Lock | Medium | 61.2% | 79.9% | ArrayHash TableString+1 |
| Number of Islands | Medium | 63.8% | 79.9% | ArrayDepth-First SearchBreadth-First Search+2 |
| Binary Tree Cameras | Hard | 47.6% | 75.2% | Dynamic ProgrammingTreeDepth-First Search+1 |
| Word Ladder | Hard | 44.9% | 75.2% | Hash TableStringBreadth-First Search |
| Pow(x, n) | Medium | 38.3% | 75.2% | MathRecursion |
| Set Matrix Zeroes | Medium | 62.5% | 75.2% | ArrayHash TableMatrix |
| Reverse Pairs | Hard | 33.7% | 69.4% | ArrayBinary SearchDivide and Conquer+4 |
| Merge Intervals | Medium | 51.2% | 69.4% | ArraySorting |
| Valid Palindrome II | Easy | 44.0% | 69.4% | Two PointersStringGreedy |
| Valid Parentheses | Easy | 43.7% | 69.4% | StringStack |
| Course Schedule | Medium | 50.8% | 69.4% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Longest Palindromic Substring | Medium | 37.4% | 69.4% | Two PointersStringDynamic Programming |
| Matchsticks to Square | Medium | 41.6% | 69.4% | ArrayDynamic ProgrammingBacktracking+2 |
| Time Based Key-Value Store | Medium | 49.7% | 69.4% | Hash TableStringBinary Search+1 |
| Group Anagrams | Medium | 72.2% | 69.4% | ArrayHash TableString+1 |
| Sort Array By Parity | Easy | 76.5% | 69.4% | ArrayTwo PointersSorting |
| 3Sum | Medium | 38.6% | 62.0% | ArrayTwo PointersSorting |
| Rotting Oranges | Medium | 58.2% | 62.0% | ArrayBreadth-First SearchMatrix |
| Interleaving String | Medium | 43.5% | 62.0% | StringDynamic Programming |
| Reconstruct Itinerary | Hard | 44.3% | 62.0% | ArrayStringDepth-First Search+4 |
| Kth Largest Element in an Array | Medium | 68.8% | 62.0% | ArrayDivide and ConquerSorting+2 |
| Sort Colors | Medium | 69.2% | 62.0% | ArrayTwo PointersSorting |
| Shortest Unsorted Continuous Subarray | Medium | 38.0% | 62.0% | ArrayTwo PointersStack+3 |
| Word Search | Medium | 46.9% | 62.0% | ArrayStringBacktracking+2 |
| Maximal Square | Medium | 50.0% | 62.0% | ArrayDynamic ProgrammingMatrix |
| Jump Game II | Medium | 42.5% | 62.0% | ArrayDynamic ProgrammingGreedy |
| Restore the Array From Adjacent Pairs | Medium | 75.1% | 62.0% | ArrayHash TableDepth-First Search |
| Alternating Groups II | Medium | 59.9% | 51.6% | ArraySliding Window |
| Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit | Medium | 57.4% | 51.6% | ArrayQueueSliding Window+3 |
| Reorganize String | Medium | 56.8% | 51.6% | Hash TableStringGreedy+3 |
| Concatenated Words | Hard | 49.7% | 51.6% | ArrayStringDynamic Programming+3 |
| Generate Parentheses | Medium | 78.3% | 51.6% | StringDynamic ProgrammingBacktracking |
| Nearest Exit from Entrance in Maze | Medium | 48.3% | 51.6% | ArrayBreadth-First SearchMatrix |
| Repeated Substring Pattern | Easy | 47.9% | 51.6% | StringString Matching |
| Find Peak Element | Medium | 46.8% | 51.6% | ArrayBinary Search |
| Merge k Sorted Lists | Hard | 58.9% | 51.6% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Walls and Gates | Medium | 63.8% | 51.6% | ArrayBreadth-First SearchMatrix |
| Design a Stack With Increment Operation | Medium | 79.9% | 51.6% | ArrayStackDesign |
| Best Time to Buy and Sell Stock II | Medium | 70.8% | 51.6% | ArrayDynamic ProgrammingGreedy |
| Top K Frequent Words | Medium | 60.0% | 51.6% | ArrayHash TableString+5 |
| Palindrome Linked List | Easy | 57.5% | 51.6% | Linked ListTwo PointersStack+1 |
| Clone Graph | Medium | 64.7% | 51.6% | Hash TableDepth-First SearchBreadth-First Search+1 |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 51.6% | Hash TableStringSliding Window |
| Sudoku Solver | Hard | 65.4% | 51.6% | ArrayHash TableBacktracking+1 |
| Product of Array Except Self | Medium | 68.6% | 51.6% | ArrayPrefix Sum |
| Decode String | Medium | 62.3% | 51.6% | StringStackRecursion |
| Find Median from Data Stream | Hard | 54.2% | 51.6% | Two PointersDesignSorting+2 |
| Block Placement Queries | Hard | 18.4% | 51.6% | ArrayBinary SearchBinary Indexed Tree+2 |
| Alien Dictionary | Hard | 37.1% | 51.6% | ArrayStringDepth-First Search+3 |
| Substring with Concatenation of All Words | Hard | 34.0% | 51.6% | Hash TableStringSliding Window |