Study guides for shortened time frames
(based on v2.0.0 of 2015)
Primitive Types
| Problem | LeetCode |
|---|---|
| 5.1 | |
| 5.2 | |
| 5.3 | 190. Reverse Bits |
| 5.4 | |
| 5.5 | |
| 5.6 | |
| 5.7 | 50. Pow(x,n) |
| 5.8 | |
| 5.9 | 9. Palindrome Number |
| 5.10 | 470. Implement Rand10() using Rand7() note: book is implement Rand6() with Rand2() |
| 5.11 | 836. Rectangle Overlap note: book asks to determine overlapping area where it exists |
Arrays
| Problem | LeetCode |
|---|---|
| 6.1 | 75. Sort Colors |
| 6.2 | 66. Plus One |
| 6.3 | 43. Multiple Strings |
| 6.4 | 55. Jump Game |
| 6.5 | 26. Remove Duplicates from Sorted Array |
| 6.6 | 121. Best Time to Buy and Sell Stock |
| 6.7 | 123. Best Time to Buy and Sell Stock III |
| 6.8 | 280. Wiggle Sort |
| 6.9 | 204. Count Primes note: book asks to return a list of the primes |
| 6.10 | |
| 6.11 | |
| 6.12 | |
| 6.13 | |
| 6.14 | |
| 6.15 | |
| 6.16 | |
| 6.17 | 36. Valid Sudoku |
| 6.18 | 54. Spiral Matrix |
| 6.19 | 48. Rotate Image |
| 6.20 | 118. Pascal's Triangle |
Strings
| Problem | LeetCode |
|---|---|
| 7.1 (C0) | 8. String to Integer (atoi) note: book asks for Integer to String (itoa) as well |
| 7.2 (C1) | |
| 7.3 | 171. Excel Sheet Column Number |
| 7.4 (C1) | |
| 7.5 (C2) | 125. Valid Palindrome |
| 7.6 (C2) | 186. Reverse Words in a String II |
| 7.7 (C3) | 17. Letter Combinations of a Phone Number |
| 7.8 (C3) | 38. Count and Say |
| 7.9 (C4) | 13. Roman to Integer |
| 7.10 | |
| 7.11 (C4) | |
| 7.12 | 443. String Compression |
| 7.13 | 28. Implement strStr() |
Linked Lists
| Problem | LeetCode |
|---|---|
| 8.1 (C0) | 21. Merge Two Sorted Lists |
| 8.2 (C1) | 206. Reverse Linked List |
| 8.3 (C1) | 142. Linked List Cycle II |
| 8.4 (C2) | 160. Intersection of Two Linked Lists |
| 8.5 | |
| 8.6 | 237. Delete Node in a Linked List |
| 8.7 (C2) | 19. Remove Nth Node From End of List |
| 8.8 | 83. Remove Duplicates from Sorted List |
| 8.9 | 61. Rotate List |
| 8.10 (C3) | 328. Odd Even Linked List note: odd first instead of even |
| 8.11 (C4) | 234. Palindrome Linked List |
| 8.12 | 86. Partition List |
| 8.13 | 2. Add Two Numbers |
Stacks and Queues
| Problem | LeetCode |
|---|---|
| 9.1 (C0) | 155. Min Stack note: min instead of max |
| 9.2 (C2) | 150. Evaluate Reverse Polish Notation |
| 9.3 (C3) | 20. Valid Parenthesis |
| 9.4 | 71. Simplify Path |
| 9.5 | |
| 9.6 | 102. Binary Tree Level Order Traversal |
| 9.7 (C1) | 622. Design Circular Queue |
| 9.8 (C2) | 232. Implement Queue using Stacks |
| 9.9 (C3) |
Binary Trees
| Problem | LeetCode |
|---|---|
| 10.1 (C0) | 110. Balanced Binary Tree |
| 10.2 (C2) | 101. Symmetric Tree |
| 10.3 | 236. Lowest Common Ancestor of a Binary Tree |
| 10.4 (C1) | |
| 10.5 | 129. Sum Root to Leaf Numbers |
| 10.6 | 112. Path Sum |
| 10.7 | 94. Binary Tree Inorder Traversal note: solve without recursion |
| 10.8 | 144. Binary Tree Preorder Traversal note: solve without recursion |
| 10.9 | |
| 10.10 | |
| 10.11 | 94. Binary Tree Inorder Traversal note: solve with constant space |
| 10.12 | 105. Construct Binary Tree from Preorder and Inorder Traversal |
| 10.13 | 1028. Recover a Tree From Preorder Traversal |
| 10.14 | |
| 10.15 | 545. Boundary of Binary Tree |
| 10.16 |
Heaps
| Problem | LeetCode |
|---|---|
| 11.1 (C0) | |
| 11.2 | |
| 11.3 (C2) | |
| 11.4 (C1) | 973. K Closest Points to Origin |
| 11.5 | 295. Find Median from Data Stream |
| 11.6 |
Searching
| Problem | LeetCode |
|---|---|
| 12.1 (C0) | |
| 12.2 | |
| 12.3 (C2) | 33. Search in Rotated Sorted Array |
| 12.4 (C1) | 69. Sqrt(x) |
| 12.5 | |
| 12.6 | 240. Search a 2D Matrix II |
| 12.7 | |
| 12.8 (C1) | 215. Kth Largest Element in an Array |
| 12.9 (C2) | |
| 12.10 |
Hash Tables
| Problem | LeetCode |
|---|---|
| 13.1 (C2) | 266. Palindrome Permutation |
| 13.2 (C0) | 383. Ransom Note |
| 13.3 (C1) | |
| 13.4 | |
| 13.5 | |
| 13.6 (C1) | 76. Minimum Window Substring note: strings instead of arrays |
| 13.7 | 727. Minimum Window Subsequence note: strings instead of arrays |
| 13.8 | |
| 13.9 | |
| 13.10 | |
| 13.11 | |
| 13.12 |
Sorting
| Problem | LeetCode |
|---|---|
| 14.1 (C0) | |
| 14.2 (C1) | 88. Merge Sorted Array |
| 14.3 | 274. H-Index |
| 14.4 (C2) | |
| 14.5 | |
| 14.6 (C3) | |
| 14.7 (C4) | 56. Merge Intervals |
| 14.8 | |
| 14.9 (C3) | |
| 14.10 | |
| 14.11 | 148. Sort List |
| 14.12 |
Binary Search Trees
| Problem | LeetCode |
|---|---|
| 15.1 (C0) | 98. Validate Binary Search Tree |
| 15.2 (C1) | 285. Inorder Successor in BST |
| 15.3 (C1) | |
| 15.4 (C2) | 235. Lowest Common Ancestor of a Binary Search Tree |
| 15.5 | |
| 15.6 | |
| 15.7 | |
| 15.8 (C2) | 108. Convert Sorted Array to Binary Search Tree |
| 15.9 | |
| 15.10 | |
| 15.11 |
Recursion
| Problem | LeetCode |
|---|---|
| 16.1 (C0) | |
| 16.2 (C1) | 51. N-Queens |
| 16.3 (C3) | 46. Permutations |
| 16.4 (C3) | 78. Subsets |
| 16.5 | |
| 16.6 (C4) | 22. Generate Parentheses |
| 16.7 (C4) | 131. Palindrome Partioning |
| 16.8 | |
| 16.9 (C3) | 37. Sudoku Solver |
| 16.10 | 89. Gray Code |
Dynamic Programming
| Problem | LeetCode |
|---|---|
| 17.1 (C0) | |
| 17.2 (C1) | |
| 17.3 (C2) | 62. Unique Paths |
| 17.4 | |
| 17.5 (C3) | |
| 17.6 (C2) | |
| 17.7 (C3) | 140. Word Break II |
| 17.8 | 120. Triangle |
| 17.9 | 877. Stone Game |
| 17.10 | 70 Climbing Stairs |
| 17.11 | |
| 17.12 (C4) | 300. Longest Increasing Subsequence |
Greedy Algorithms and Invariants
| Problem | LeetCode |
|---|---|
| 18.1 | |
| 18.2 | |
| 18.3 | |
| 18.4 (C0) | 15. 3Sum |
| 18.5 (C2) | 169. Majority Element |
| 18.6 (C1) | 134. Gas Station |
| 18.7 (C2) | 11. Container With Most Water |
| 18.8 (C3) | 84. Largest Rectangle in Histogram |
Graphs
| Problem | LeetCode |
|---|---|
| 19.1 (C0) | 505. The Maze II note: shortest path instead of any path |
| 19.2 (C2) | 733. Flood Fill |
| 19.3 (C3) | 1020. Number of Enclaves |
| 19.4 | |
| 19.5 | |
| 19.6 | |
| 19.7 (C1) | |
| 19.8 |