| 1 | Two Sum | Read solution |
| 2 | Insert Interval | — |
| 3 | Text Justification | — |
| 4 | Minimum Window Substring | — |
| 5 | Maximal Rectangle | — |
| 6 | The Skyline Problem | — |
| 7 | Maximal Square | — |
| 8 | Meeting Rooms II | — |
| 9 | Find Median from Data Stream | Read solution |
| 10 | Bulls and Cows | — |
| 11 | Count of Smaller Numbers After Self | — |
| 12 | Longest Increasing Path in a Matrix | — |
| 13 | Longest Substring with At Most K Distinct Characters | — |
| 14 | Moving Average from Data Stream | — |
| 15 | Logger Rate Limiter | — |
| 16 | Design Hit Counter | — |
| 17 | Max Sum of Rectangle No Larger Than K | — |
| 18 | Decode String | — |
| 19 | Evaluate Division | — |
| 20 | Split Array Largest Sum | — |
| 21 | Robot Room Cleaner | — |
| 22 | Random Pick with Weight | — |
| 23 | Subarray Sum Equals K | — |
| 24 | Longest Line of Consecutive One in Matrix | — |
| 25 | Design Search Autocomplete System | — |
| 26 | Split Array into Consecutive Subsequences | — |
| 27 | 24 Game | — |
| 28 | Minimum Window Subsequence | — |
| 29 | Network Delay Time | — |
| 30 | Open the Lock | — |
| 31 | Expressive Words | — |
| 32 | Find And Replace in String | — |
| 33 | Guess the Word | — |
| 34 | Hand of Straights | — |
| 35 | Shortest Subarray with Sum at Least K | — |
| 36 | X of a Kind in a Deck of Cards | — |
| 37 | Minimum Area Rectangle | — |
| 38 | Validate Stack Sequences | — |
| 39 | Flip Equivalent Binary Trees | — |
| 40 | Minimum Domino Rotations For Equal Row | — |
| 41 | Longest String Chain | — |
| 42 | Shortest Way to Form String | — |
| 43 | Confusing Number II | — |
| 44 | Delete Nodes And Return Forest | — |
| 45 | Snapshot Array | — |
| 46 | String Transforms Into Another String | — |
| 47 | Divide Chocolate | — |
| 48 | Divide Array in Sets of K Consecutive Numbers | — |
| 49 | Minimum Distance to Type a Word Using Two Fingers | — |
| 50 | Time Needed to Inform All Employees | — |