| LRU Cache | Medium | 46.8% | 100.0% | Hash TableLinked ListDesign+1 |
| Number of Islands | Medium | 63.8% | 100.0% | ArrayDepth-First SearchBreadth-First Search+2 |
| Trapping Rain Water | Hard | 66.8% | 87.5% | ArrayTwo PointersDynamic Programming+2 |
| Vertical Order Traversal of a Binary Tree | Hard | 53.2% | 87.5% | Hash TableTreeDepth-First Search+3 |
| Stone Game IX | Medium | 29.8% | 87.5% | ArrayMathGreedy+2 |
| Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 23.0% | 87.5% | ArrayTwo PointersBinary Search+5 |
| Number of Paths with Max Score | Hard | 42.0% | 87.5% | ArrayDynamic ProgrammingMatrix |
| Largest 1-Bordered Square | Medium | 52.0% | 87.5% | ArrayDynamic ProgrammingMatrix |
| Longest Increasing Subsequence | Medium | 59.0% | 87.5% | ArrayBinary SearchDynamic Programming |
| Burst Balloons | Hard | 62.9% | 87.5% | ArrayDynamic Programming |
| Maximum Height by Stacking Cuboids | Hard | 61.7% | 87.5% | ArrayDynamic ProgrammingSorting |
| Maximum Product of Two Elements in an Array | Easy | 83.5% | 87.5% | ArraySortingHeap (Priority Queue) |
| Number of Nodes in the Sub-Tree With the Same Label | Medium | 55.3% | 87.5% | Hash TableTreeDepth-First Search+2 |
| Find the Width of Columns of a Grid | Easy | 70.4% | 87.5% | ArrayMatrix |
| Design Graph With Shortest Path Calculator | Hard | 64.8% | 87.5% | Graph TheoryDesignHeap (Priority Queue)+1 |
| Minimum Cost of a Path With Special Roads | Medium | 42.4% | 87.5% | ArrayGraph TheoryHeap (Priority Queue)+1 |
| Two Sum IV - Input is a BST | Easy | 63.0% | 87.5% | Hash TableTwo PointersTree+4 |
| Minimize Deviation in Array | Hard | 54.0% | 87.5% | ArrayGreedyHeap (Priority Queue)+1 |
| Faulty Keyboard | Easy | 80.0% | 87.5% | StringSimulation |
| Minimum Number of Operations to Make String Sorted | Hard | 50.7% | 87.5% | Hash TableMathString+2 |
| Count Prefix and Suffix Pairs II | Hard | 28.0% | 87.5% | ArrayStringTrie+3 |
| Mark Elements on Array by Performing Queries | Medium | 49.1% | 87.5% | ArrayHash TableSorting+2 |
| Substring with Concatenation of All Words | Hard | 34.0% | 87.5% | Hash TableStringSliding Window |
| Guess Number Higher or Lower | Easy | 57.1% | 87.5% | Binary SearchInteractive |
| Find Maximum Value in a Constrained Sequence | Medium | 62.3% | 87.5% | ArrayGreedy |
| Two Sum | Easy | 57.1% | 75.0% | ArrayHash Table |
| Best Time to Buy and Sell Stock | Easy | 56.4% | 75.0% | ArrayDynamic Programming |
| Is Graph Bipartite? | Medium | 58.9% | 75.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Maximize Distance to Closest Person | Medium | 49.6% | 75.0% | Array |
| Rotting Oranges | Medium | 58.1% | 75.0% | ArrayBreadth-First SearchMatrix |
| Possible Bipartition | Medium | 52.3% | 75.0% | Depth-First SearchBreadth-First SearchUnion-Find+1 |
| Find Peak Element | Medium | 46.8% | 75.0% | ArrayBinary Search |
| 3Sum | Medium | 38.6% | 62.5% | ArrayTwo PointersSorting |
| Maximum Subarray | Medium | 53.0% | 62.5% | ArrayDivide and ConquerDynamic Programming |
| Word Search | Medium | 46.8% | 62.5% | ArrayStringBacktracking+2 |
| Longest Common Prefix | Easy | 47.1% | 62.5% | ArrayStringTrie |
| Merge k Sorted Lists | Hard | 58.8% | 62.5% | Linked ListDivide and ConquerHeap (Priority Queue)+1 |
| Subarray Product Less Than K | Medium | 53.9% | 62.5% | ArrayBinary SearchSliding Window+1 |
| Trapping Rain Water II | Hard | 64.0% | 62.5% | ArrayBreadth-First SearchHeap (Priority Queue)+1 |
| Sort Colors | Medium | 69.1% | 62.5% | ArrayTwo PointersSorting |
| Divide Two Integers | Medium | 19.4% | 62.5% | MathBit Manipulation |
| Intersection of Two Linked Lists | Easy | 63.2% | 62.5% | Hash TableLinked ListTwo Pointers |
| Add Two Numbers | Medium | 47.9% | 50.0% | Linked ListMathRecursion |
| Palindrome Number | Easy | 60.2% | 50.0% | Math |
| Valid Parentheses | Easy | 43.7% | 50.0% | StringStack |
| Search in Rotated Sorted Array | Medium | 44.1% | 50.0% | ArrayBinary Search |
| Merge Intervals | Medium | 51.1% | 50.0% | ArraySorting |
| Linked List Cycle | Easy | 53.9% | 50.0% | Hash TableLinked ListTwo Pointers |
| Meeting Rooms II | Medium | 52.5% | 50.0% | |
| Coin Change | Medium | 47.9% | 50.0% | ArrayDynamic ProgrammingBreadth-First Search |
| Make Sum Divisible by P | Medium | 42.6% | 50.0% | ArrayHash TablePrefix Sum |
| Remove K Digits | Medium | 36.4% | 50.0% | StringStackGreedy+1 |
| Convert Sorted Array to Binary Search Tree | Easy | 75.2% | 50.0% | ArrayDivide and ConquerTree+2 |
| Find Median from Data Stream | Hard | 54.2% | 50.0% | Two PointersDesignSorting+2 |
| Word Ladder | Hard | 44.9% | 50.0% | Hash TableStringBreadth-First Search |
| Rotate Array | Medium | 44.4% | 50.0% | ArrayMathTwo Pointers |
| Permutations | Medium | 81.6% | 50.0% | ArrayBacktracking |
| Generate Parentheses | Medium | 78.2% | 50.0% | StringDynamic ProgrammingBacktracking |
| Path with Maximum Probability | Medium | 65.5% | 50.0% | ArrayGraph TheoryHeap (Priority Queue)+1 |
| Merge Sorted Array | Easy | 54.4% | 50.0% | ArrayTwo PointersSorting |
| Move Zeroes | Easy | 63.5% | 50.0% | ArrayTwo Pointers |
| Next Permutation | Medium | 44.7% | 50.0% | ArrayTwo Pointers |
| Jump Game II | Medium | 42.5% | 50.0% | ArrayDynamic ProgrammingGreedy |
| Split Array Largest Sum | Hard | 59.8% | 50.0% | ArrayBinary SearchDynamic Programming+2 |
| Median of Two Sorted Arrays | Hard | 45.9% | 50.0% | ArrayBinary SearchDivide and Conquer |
| Longest Palindromic Substring | Medium | 37.3% | 50.0% | Two PointersStringDynamic Programming |
| Rotate Image | Medium | 79.3% | 50.0% | ArrayMathMatrix |
| Edit Distance | Medium | 60.1% | 50.0% | StringDynamic Programming |
| Exam Room | Medium | 43.2% | 50.0% | DesignHeap (Priority Queue)Ordered Set |