| 2 | Add Two Numbers | Medium | linked list |
| 3 | Longest Substring Without Repeating Characters | Medium | hash table |
| 7 | Reverse Integer | Easy | math |
| 8 | String to Integer (atoi) | Easy | string |
| 11 | Container With Most Water | Medium | greedy |
| 20 | Valid Parentheses | Easy | stack |
| 42 | Trapping Rain Water | Hard | greedy |
| 50 | Pow(x, n) | Medium | math |
| 56 | Merge Intervals | Hard | sort |
| 62 | Unique Paths | Medium | dynamic programming |
| 63 | Unique Paths II | Medium | dynamic programming |
| 66 | Plus One | Easy | array |
| 70 | Climbing Stairs | Easy | dynamic programming |
| 78 | Subsets | Medium | backtracking |
| 79 | Word Search | Medium | backtracking |
| 91 | Decode Ways | Medium | dynamic programming |
| 94 | Binary Tree Inorder Traversal | Medium | tree |
| 98 | Validate Binary Search Tree | Medium | recursion |
| 100 | Same Tree | Easy | recursion |
| 101 | Symmetric Tree | Easy | stack |
| 102 | Binary Tree Level Order Traversal | Easy | breadth first search |
| 103 | Binary Tree Zigzag Level Order Traversal | Medium | breadth first search |
| 104 | Maximum Depth of Binary Tree | Easy | recursion |
| 105 | Construct Binary Tree from Preorder and Inorder Traversal | Medium | recursion |
| 110 | Balanced Binary Tree | Easy | recursion |
| 113 | Path Sum II | Medium | depth first search |
| 116 | Populating Next Right Pointers in Each Node | Medium | recursion |
| 117 | Populating Next Right Pointers in Each Node II | Hard | breadth first search |
| 121 | Best Time to Buy and Sell Stock | Easy | array |
| 122 | Best Time to Buy and Sell Stock II | Easy | greedy |
| 138 | Copy List with Random Pointer | Medium | linked list |
| 139 | Word Break | Medium | dynamic programming |
| 141 | Linked List Cycle | Easy | two pointers |
| 142 | Linked List Cycle II | Medium | two pointers |
| 146 | LRU Cache | Hard | design |
| 151 | Reverse Words in a String | Medium | string |
| 155 | Min Stack | Easy | stack |
| 160 | Intersection of Two Linked Lists | Easy | linked list |
| 172 | Factorial Trailing Zeroes | Easy | math |
| 189 | Rotate Array | Easy | array |
| 199 | Binary Tree Right Side View | Medium | depth first search |
| 200 | Number of Islands | Medium | depth first search |
| 206 | Reverse Linked List | Easy | linked list |
| 208 | Implement Trie (Prefix Tree) | Medium | tree |
| 215 | Kth Largest Element in an Array | Medium | array |
| 230 | Kth Smallest Element in a BST | Medium | binary search tree |
| 232 | Implement Queue using Stacks | Easy | stack |
| 234 | Palindrome Linked List | Easy | linked list |
| 242 | Valid Anagram | Easy | string |
| 268 | Missing Number | Medium | bit manipulation |
| 283 | Move Zeroes | Easy | two pointers |
| 287 | Find the Duplicate Number | Hard | two pointers |
| 322 | Coin Change | Medium | dynamic programming |
| 328 | Odd Even Linked List | Medium | linked list |
| 340 | Longest Substring with At Most K Distinct Characters | Hard | hash table |
| 387 | First Unique Character in a String | Easy | hash table |
| 394 | Decode String | Medium | stack |
| 445 | Add Two Numbers II | Medium | linked list |
| 451 | Sort Characters By Frequency | Medium | sort |
| 496 | Next Greater Element I | Easy | stack |
| 543 | Diameter of Binary Tree | Easy | tree |
| 547 | Friend Circles | Medium | depth first search |