| Rotting Oranges | Medium | 58.2% | 100.0% | ArrayBreadth-First SearchMatrix |
| Time Based Key-Value Store | Medium | 49.7% | 94.3% | Hash TableStringBinary Search+1 |
| Read N Characters Given read4 II - Call Multiple Times | Hard | 43.2% | 93.5% | ArraySimulationInteractive |
| Minimum Window Substring | Hard | 47.0% | 91.9% | Hash TableStringSliding Window |
| Max Stack | Hard | 45.9% | 79.8% | Linked ListStackDesign+2 |
| Convert Sorted List to Binary Search Tree | Medium | 66.0% | 78.2% | Linked ListDivide and ConquerTree+2 |
| Check Completeness of a Binary Tree | Medium | 59.0% | 74.6% | TreeBreadth-First SearchBinary Tree |
| Car Pooling | Medium | 56.2% | 74.6% | ArraySortingHeap (Priority Queue)+2 |
| String Compression | Medium | 59.6% | 74.6% | Two PointersString |
| Smallest Range Covering Elements from K Lists | Hard | 70.1% | 74.6% | ArrayHash TableGreedy+3 |
| Range Sum Query 2D - Immutable | Medium | 57.9% | 70.1% | ArrayDesignMatrix+1 |
| Min Stack | Medium | 57.7% | 67.5% | StackDesign |
| Word Ladder II | Hard | 27.5% | 64.4% | Hash TableStringBacktracking+1 |
| Longest Consecutive Sequence | Medium | 47.0% | 60.8% | ArrayHash TableUnion Find |
| Decode Ways | Medium | 37.6% | 56.4% | StringDynamic Programming |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 56.4% | Hash TableStringSliding Window |
| Water and Jug Problem | Medium | 45.0% | 56.4% | MathDepth-First SearchBreadth-First Search |
| Implement Trie (Prefix Tree) | Medium | 69.2% | 56.4% | Hash TableStringDesign+1 |
| Sort List | Medium | 63.9% | 50.7% | Linked ListTwo PointersDivide and Conquer+2 |
| Meeting Rooms II | Medium | 52.6% | 50.7% | ArrayTwo PointersGreedy+3 |
| Asteroid Collision | Medium | 47.2% | 50.7% | ArrayStackSimulation |
| Product of Array Except Self | Medium | 68.6% | 50.7% | ArrayPrefix Sum |
| Maximum Candies You Can Get from Boxes | Hard | 67.9% | 50.7% | ArrayBreadth-First SearchGraph |
| Process Tasks Using Servers | Medium | 42.0% | 42.7% | ArrayHeap (Priority Queue) |
| Find Minimum Time to Finish All Jobs | Hard | 45.4% | 42.7% | ArrayDynamic ProgrammingBacktracking+2 |
| Coordinate With Maximum Network Quality | Medium | 39.3% | 42.7% | ArrayEnumeration |