| Check if an Original String Exists Given Two Encoded Strings | Hard | 43.5% | 100.0% | StringDynamic Programming |
| Number of Islands | Medium | 63.8% | 87.5% | ArrayDepth-First SearchBreadth-First Search+2 |
| Gas Station | Medium | 47.5% | 87.5% | ArrayGreedy |
| LRU Cache | Medium | 46.8% | 87.5% | Hash TableLinked ListDesign+1 |
| Longest Substring with At Most K Distinct Characters | Medium | 49.9% | 75.0% | |
| Bus Routes | Hard | 47.1% | 75.0% | ArrayHash TableBreadth-First Search |
| Longest Palindromic Substring | Medium | 37.3% | 75.0% | Two PointersStringDynamic Programming |
| Longest Substring Without Repeating Characters | Medium | 38.5% | 75.0% | Hash TableStringSliding Window |
| Game of Life | Medium | 72.3% | 62.5% | ArrayMatrixSimulation |
| Trapping Rain Water | Hard | 66.8% | 62.5% | ArrayTwo PointersDynamic Programming+2 |
| Lowest Common Ancestor of a Binary Tree | Medium | 68.7% | 62.5% | TreeDepth-First SearchBinary Tree |
| Subarray Sum Equals K | Medium | 46.8% | 62.5% | ArrayHash TablePrefix Sum |
| Largest Rectangle in Histogram | Hard | 49.3% | 62.5% | ArrayStackMonotonic Stack |
| Course Schedule | Medium | 50.8% | 62.5% | Depth-First SearchBreadth-First SearchGraph Theory+1 |
| Vertical Order Traversal of a Binary Tree | Hard | 53.2% | 62.5% | Hash TableTreeDepth-First Search+3 |