| 1 | Merge k Sorted Lists | Read solution |
| 2 | Divide Two Integers | — |
| 3 | Next Permutation | Read solution |
| 4 | Multiply Strings | Read solution |
| 5 | Pow(x, n) | Read solution |
| 6 | Merge Intervals | Read solution |
| 7 | Valid Number | Read solution |
| 8 | Add Binary | Read solution |
| 9 | Merge Sorted Array | Read solution |
| 10 | Binary Tree Maximum Path Sum | Read solution |
| 11 | Valid Palindrome | — |
| 12 | Word Break | Read solution |
| 13 | Read N Characters Given Read4 II - Call multiple times | — |
| 14 | Binary Search Tree Iterator | Read solution |
| 15 | Binary Tree Right Side View | — |
| 16 | Add and Search Word - Data structure design | — |
| 17 | Kth Largest Element in an Array | Read solution |
| 18 | Product of Array Except Self | Read solution |
| 19 | Group Shifted Strings | — |
| 20 | Alien Dictionary | — |
| 21 | Closest Binary Search Tree Value | — |
| 22 | Integer to English Words | — |
| 23 | First Bad Version | — |
| 24 | Expression Add Operators | — |
| 25 | Serialize and Deserialize Binary Tree | Read solution |
| 26 | Remove Invalid Parentheses | — |
| 27 | Sparse Matrix Multiplication | — |
| 28 | Longest Substring with At Most K Distinct Characters | — |
| 29 | Intersection of Two Arrays | — |
| 30 | Random Pick Index | — |
| 31 | Add Strings | — |
| 32 | Continuous Subarray Sum | — |
| 33 | Random Pick with Weight | — |
| 34 | Diameter of Binary Tree | Read solution |
| 35 | Subarray Sum Equals K | — |
| 36 | Task Scheduler | — |
| 37 | Exclusive Time of Functions | — |
| 38 | Maximum Swap | — |
| 39 | Valid Palindrome II | — |
| 40 | Maximum Sum of 3 Non-Overlapping Subarrays | — |
| 41 | Accounts Merge | — |
| 42 | Reorganize String | — |
| 43 | Is Graph Bipartite? | Read solution |
| 44 | Similar String Groups | — |
| 45 | Range Sum of BST | — |
| 46 | Verifying an Alien Dictionary | — |
| 47 | K Closest Points to Origin | Read solution |
| 48 | Vertical Order Traversal of a Binary Tree | Read solution |
| 49 | Lowest Common Ancestor of Deepest Leaves | — |
| 50 | Minimum Remove to Make Valid Parentheses | — |
