| Number | Title |
|---|---|
| 001 | Two Sum |
| 020 | Valid Parentheses |
| 021 | Merge Two Sorted Lists |
| 108 | Convert Sorted Array to Binary Search Tree |
| 121 | Best Time to Buy and Sell Stock |
| 141 | Linked List Cycle |
| 155 | Min Stack |
| 160 | Intersection of Two Linked Lists |
| 206 | Reverse Linked List |
| 235 | Lowest Common Ancestor of a BST |
| 258 | Add Digits |
| 266 | Palindrome Permutation |
| 270 | Closest Binary Search Tree Value |
| 292 | Nim Game |
| 293 | Flip Game |
| 344 | Reverse String |
| 346 | Moving Average from Data Stream |
| 414 | Third Maximum Number |
| 438 | Find All Anagrams in a String |
| Number | Title |
|---|---|
| 002 | Add Two Number |
| 003 | Longest Substring Without Repeating Characters |
| 005 | Longest Palindromic Substring |
| 048 | Rotate Image |
| 062 | Unique Paths |
| 098 | Validate Binary Search Tree |
| 109 | Convert Sorted List to Binary Search Tree |
| 138 | Copy List with Random Pointer |
| 200 | Number of Islands |
| 208 | [Implement Trie (Prefix Tree)] (Mędium/TrieNode.md) |
| 236 | Lowest Common Ancestor of a Binary Tree |
| 238 | Product of Array Except Self |
| 331 | Verify Preorder Serialization of a Binary Tree |
| 449 | Serialize and Deserialize BST |
| Number | Title |
|---|---|
| 042 | Trapping Rain Water - NOT DONE |
| 297 | Serialize and Deserialize Binary Tree |
| 329 | Longest Increasing Path in a Matrix |
| Number | Title |
|---|---|
| 1.1 | Is Unique |
| 1.2 | Check Permutation |
| 1.3 | URLify |
| 1.4 | Palindrome Permutation |
| 1.5 | One Away |
| 1.6 | String Compression |
| 1.7 | Rotate Matrix |
| 1.8 | Zero Matrix |
| 1.9 | String Rotation |
| Number | Title |
|---|---|
| 2.1 | Remove Dups |
| 2.2 | Return Kth to Last |
| 2.3 | Delete Middle Node |
| 2.4 | Partition |
| 2.5 | Sum Lists |
| 2.6 | Palindrome |
| 2.7 | Intersection |
| 2.8 | Loop Detection |
| Number | Title |
|---|---|
| 3.1 | Three in One |
| 3.2 | Stack Min |
| 3.3 | Stack of Plates |
| 3.4 | Queue via Stacks |
| 3.5 | Sort Stack |
| 3.6 | Animal Shelter |
| Number | Title |
|---|---|
| 4.1 | Route Between Nodes |
| 4.2 | Minimal Tree |
| 4.3 | List of Depths |
| 4.4 | Check Balanced |
| 4.5 | Validate BST |
| 4.6 | Successor |
| 4.7 | Build Order |
| 4.8 | First Common Ancestor |
| 4.9 | BST Sequence |
| 4.10 | Check Subtree |
| 4.11 | Random Node |
| 4.12 | Paths With Sum |