| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Burst Balloons | Hard | 63.0% | 98.0% | ArrayDynamic Programming |
| Number of Islands | Medium | 63.8% | 95.9% | ArrayDepth-First SearchBreadth-First Search+2 |
| Longest Increasing Subsequence | Medium | 59.1% | 95.9% | ArrayBinary SearchDynamic Programming |
| Vertical Order Traversal of a Binary Tree | Hard | 53.3% | 95.9% | Hash TableTreeDepth-First Search+3 |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 93.7% | ArrayTwo PointersBinary Search+5 |
| Minimum Cost of a Path With Special Roads | Medium | 42.5% | 93.7% | ArrayGraph TheoryHeap (Priority Queue)+1 |
| Minimize Deviation in Array | Hard | 54.0% | 93.7% | ArrayGreedyHeap (Priority Queue)+1 |
| Number of Paths with Max Score | Hard | 42.1% | 93.7% | ArrayDynamic ProgrammingMatrix |
| Count Prefix and Suffix Pairs II | Hard | 28.1% | 91.1% | ArrayStringTrie+3 |
| Mark Elements on Array by Performing Queries | Medium | 49.1% | 91.1% | ArrayHash TableSorting+2 |
| Substring with Concatenation of All Words | Hard | 34.0% | 91.1% | Hash TableStringSliding Window |
| Guess Number Higher or Lower | Easy | 57.2% | 91.1% | Binary SearchInteractive |
| Maximum Product of Two Elements in an Array | Easy | 83.5% | 91.1% | ArraySortingHeap (Priority Queue) |
| Faulty Keyboard | Easy | 80.0% | 91.1% | StringSimulation |
| Number of Nodes in the Sub-Tree With the Same Label | Medium | 55.4% | 91.1% | Hash TableTreeDepth-First Search+2 |
| Stone Game IX | Medium | 30.0% | 91.1% | ArrayMathGreedy+2 |
| Two Sum IV - Input is a BST | Easy | 63.0% | 91.1% | Hash TableTwo PointersTree+4 |
| Find the Width of Columns of a Grid | Easy | 70.4% | 91.1% | ArrayMatrix |
| Minimum Number of Operations to Make String Sorted | Hard | 50.7% | 91.1% | Hash TableMathString+2 |
| Design Graph With Shortest Path Calculator | Hard | 64.9% | 91.1% | Graph TheoryDesignHeap (Priority Queue)+1 |
| Largest 1-Bordered Square | Medium | 52.0% | 91.1% | ArrayDynamic ProgrammingMatrix |
| Maximum Height by Stacking Cuboids | Hard | 61.7% | 91.1% | ArrayDynamic ProgrammingSorting |
| Trapping Rain Water | Hard | 66.8% | 88.4% | ArrayTwo PointersDynamic Programming+2 |
| Find Maximum Value in a Constrained Sequence | Medium | 62.2% | 88.4% | ArrayGreedy |
| Maximize Distance to Closest Person | Medium | 49.6% | 81.8% | Array |
| Two Sum | Easy | 57.1% | 81.8% | ArrayHash Table |
| Is Graph Bipartite? | Medium | 58.9% | 77.7% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Rotting Oranges | Medium | 58.2% | 72.9% | ArrayBreadth-First SearchMatrix |
| Possible Bipartition | Medium | 52.4% | 72.9% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Find Peak Element | Medium | 46.8% | 72.9% | ArrayBinary Search |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 67.1% | ArrayDynamic Programming |
| Subarray Product Less Than K | Medium | 53.9% | 67.1% | ArrayBinary SearchSliding Window+1 |
| 3Sum | Medium | 38.6% | 59.6% | ArrayTwo PointersSorting |
| Rotate Array | Medium | 44.5% | 59.6% | ArrayMathTwo Pointers |
| Merge k Sorted Lists | Hard | 58.9% | 59.6% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Divide Two Integers | Medium | 19.4% | 59.6% | MathBit Manipulation |
| Sort Colors | Medium | 69.2% | 59.6% | ArrayTwo PointersSorting |
| Generate Parentheses | Medium | 78.3% | 59.6% | StringDynamic ProgrammingBacktracking |
| Valid Parentheses | Easy | 43.7% | 49.1% | StringStack |
| Maximum Subarray | Medium | 53.0% | 49.1% | ArrayDivide and ConquerDynamic Programming |
| Longest Common Prefix | Easy | 47.1% | 49.1% | ArrayStringTrie |
| Make Sum Divisible by P | Medium | 42.6% | 49.1% | ArrayHash TablePrefix Sum |
| Remove K Digits | Medium | 36.4% | 49.1% | StringStackGreedy+1 |
| Word Search | Medium | 46.9% | 49.1% | ArrayStringBacktracking+2 |
| Word Ladder | Hard | 44.9% | 49.1% | Hash TableStringBreadth-First Search |
| Permutations | Medium | 81.7% | 49.1% | ArrayBacktracking |
| Search in Rotated Sorted Array | Medium | 44.1% | 49.1% | ArrayBinary Search |
| Path with Maximum Probability | Medium | 65.5% | 49.1% | ArrayGraph TheoryHeap (Priority Queue)+1 |
| Coin Change | Medium | 48.0% | 49.1% | ArrayDynamic ProgrammingBreadth-First Search |
| Next Permutation | Medium | 44.8% | 49.1% | ArrayTwo Pointers |
| Trapping Rain Water II | Hard | 64.0% | 49.1% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Merge Intervals | Medium | 51.2% | 49.1% | ArraySorting |
| Intersection of Two Linked Lists | Easy | 63.2% | 49.1% | Hash TableLinked ListTwo Pointers |
| Merge Sorted Array | Easy | 54.4% | 49.1% | ArrayTwo PointersSorting |
| Move Zeroes | Easy | 63.6% | 49.1% | ArrayTwo Pointers |
| Split Array Largest Sum | Hard | 59.9% | 49.1% | ArrayBinary SearchDynamic Programming+2 |
| Jump Game II | Medium | 42.5% | 49.1% | ArrayDynamic ProgrammingGreedy |
| IPO | Hard | 53.3% | 49.1% | ArrayGreedySorting+1 |
| Median of Two Sorted Arrays | Hard | 46.0% | 49.1% | ArrayBinary SearchDivide and Conquer |
| Longest Palindromic Substring | Medium | 37.4% | 49.1% | Two PointersStringDynamic Programming |
| Rotate Image | Medium | 79.4% | 49.1% | ArrayMathMatrix |
| Edit Distance | Medium | 60.2% | 49.1% | StringDynamic Programming |
| Exam Room | Medium | 43.2% | 49.1% | DesignHeap (Priority Queue)Ordered Set |
| Check if There is a Valid Path in a Grid | Medium | 50.1% | 49.1% | ArrayDepth-First SearchBreadth-First Search+2 |