From 226fd2a6a87809bf3a45ef552de61b4874e6c10e Mon Sep 17 00:00:00 2001
From: Prad Nukala
-
-
-
+ 8-week interview-prep fight camp. Each phase is a milestone; each topic an issue; each problem a sub-issue.
+ Charts are live from the SRS Worker — the daily digest email drives the schedule.
| Phase | -Wk | -Date | -Topic | -Core | -Core problems | -
|---|---|---|---|---|---|
| I Linear Structures |
- 1 | Mon Aug 17 | 01 · Hash-Based Lookup | 5/5 | 217 · 242 · 1 · 49 · 347 | -
| 1 | Tue Aug 18 | 02 · Prefix Sum | 3/3 | 303 · 238 · 560 | -|
| 2 | Mon Aug 24 | 03 · Two Pointers | 2/4 | 125 · 167 · 15 · 11 | -|
| 2 | Tue Aug 25 | 04 · Sliding Window | 1/4 | 121 · 3 · 424 · 567 | -|
| 2 | Wed Aug 26 | 05 · Binary Search | 3/5 | 704 · 875 · 33 · 74 · 153 | -|
| 2 | Thu Aug 27 | 06 · Stack | 0/3 | 20 · 155 · 150 | -|
| 2 | Fri Aug 28 | 07 · Monotonic Stack | 0/2 | 739 · 853 | -|
| II Nodal & Grid |
- 3 | Mon Aug 31 | 08 · Linked List | 0/3 | 206 · 21 · 141 | -
| 3 | Tue Sep 1 | 09 · Hybrid Structures | 0/2 | 146 · 2 | -|
| 3 | Wed Sep 2 | 10 · Matrix Index Math | 0/3 | 48 · 54 · 73 | -|
| III Hierarchical |
- 3 | Thu Sep 3 | 11 · Tree DFS | 0/3 | 226 · 104 · 236 | -
| 3 | Fri Sep 4 | 12 · Tree BFS | 0/3 | 102 · 199 · 1448 | -|
| 4 | Mon Sep 7 | 13 · Binary Search Tree | 0/3 | 98 · 230 · 235 | -|
| 4 | Tue Sep 8 | 14 · Heap / Priority Queue | 0/3 | 215 · 973 · 23 | -|
| 4 | Wed Sep 9 | 15 · Trie | 0/2 | 208 · 211 | -|
| IV Relational |
- 4 | Thu Sep 10 | 16 · Graph DFS | 0/3 | 200 · 133 · 417 | -
| 4 | Fri Sep 11 | 17 · Graph BFS | 0/2 | 994 · 127 | -|
| 5 | Mon Sep 14 | 18 · Topological Sort | 0/2 | 207 · 210 | -|
| 5 | Tue Sep 15 | 19 · Union-Find | 0/2 | 684 · 323 | -|
| V Decision Space |
- 5 | Wed Sep 16 | 20 · Backtracking | 0/3 | 78 · 39 · 46 | -
| 5 | Thu Sep 17 | 21 · 1-D Dynamic Programming | 0/3 | 70 · 198 · 322 | -|
| 5 | Fri Sep 18 | 22 · Multi-D / Grid DP | 0/3 | 62 · 64 · 1143 | -|
| 6 | Mon Sep 21 | 23 · Greedy | 0/3 | 53 · 55 · 134 | -|
| 6 | Tue Sep 22 | 24 · Intervals | 0/3 | 57 · 56 · 435 | -|
| 1. Hash-Based Lookup builds on nothing |
+ 1. Hash-Based Lookup Wk 1 · Mon Aug 17 builds on nothing |
A | 217 | Contains Duplicate |
A | 242 | Valid Anagram | ||
B | 128 | Longest Consecutive Sequence | ||
B | 290 | Word Pattern | ||
| 2. Prefix Sum builds on 1 |
+ 2. Prefix Sum Wk 1 · Tue Aug 18 builds on 1 |
A | 303 | Range Sum Query |
A | 238 | Product of Array Except Self | ||
B | 525 | Contiguous Array | ||
B | 974 | Subarray Sums Divisible by K | ||
| 3. Two Pointers builds on ordered iteration |
+ 3. Two Pointers Wk 2 · Mon Aug 24 builds on ordered iteration |
A | 125 | Valid Palindrome |
A | 167 | Two Sum II | ||
B | 189 | Rotate Array | ||
B | 80 | Remove Duplicates II | ||
| 4. Sliding Window builds on 3 |
+ 4. Sliding Window Wk 2 · Tue Aug 25 builds on 3 |
A | 121 | Best Time to Buy and Sell Stock |
A | 3 | Longest Substring Without Repeating Characters | ||
B | 1004 | Max Consecutive Ones III | ||
B | 643 | Maximum Average Subarray | ||
| 5. Binary Search builds on ordered / monotonic invariants |
+ 5. Binary Search Wk 2 · Wed Aug 26 builds on ordered / monotonic invariants |
A | 704 | Binary Search |
A | 74 | Search a 2D Matrix | ||
B | 34 | First & Last Position | ||
B ⭐ | 4 | Median of Two Sorted Arrays | ||
| 6. Stack independent primitive |
+ 6. Stack Wk 2 · Thu Aug 27 independent primitive |
A | 20 | Valid Parentheses |
A | 155 | Min Stack | ||
B | 71 | Simplify Path | ||
B ⭐ | 224 | Basic Calculator | ||
| 7. Monotonic Stack builds on 6 |
+ 7. Monotonic Stack Wk 2 · Fri Aug 28 builds on 6 |
A | 739 | Daily Temperatures |
A | 853 | Car Fleet | ||
B ⭐ | 84 | Largest Rectangle in Histogram |
| 8. Linked List independent primitive |
+ 8. Linked List Wk 3 · Mon Aug 31 independent primitive |
A | 206 | Reverse Linked List |
A | 21 | Merge Two Sorted Lists | ||
B | 61 | Rotate List | ||
B | 86 | Partition List | ||
| 9. Hybrid Structures builds on 1 + 8 |
+ 9. Hybrid Structures Wk 3 · Tue Sep 1 builds on 1 + 8 |
A | 146 | LRU Cache |
A | 2 | Add Two Numbers | ||
B | 138 | Copy List with Random Pointer | ||
B | 380 | Insert Delete GetRandom O(1) | ||
| 10. Matrix Index Math builds on 3 — NOT graph traversal |
+ 10. Matrix Index Math Wk 3 · Wed Sep 2 builds on 3 — NOT graph traversal |
A | 48 | Rotate Image |
A | 54 | Spiral Matrix | ||
B | 289 | Game of Life |
| 11. Tree DFS builds on recursion |
+ 11. Tree DFS Wk 3 · Thu Sep 3 builds on recursion |
A | 226 | Invert Binary Tree |
A | 104 | Maximum Depth of Binary Tree | ||
B | 129 | Sum Root to Leaf Numbers | ||
B | 543 | Diameter of Binary Tree | ||
| 12. Tree BFS builds on 6's sibling (queue) + 11 |
+ 12. Tree BFS Wk 3 · Fri Sep 4 builds on 6's sibling (queue) + 11 |
A | 102 | Level Order Traversal |
A | 199 | Right Side View | ||
B | 103 | Zigzag Level Order | ||
B | 637 | Average of Levels | ||
| 13. Binary Search Tree builds on 5 + 11 |
+ 13. Binary Search Tree Wk 4 · Mon Sep 7 builds on 5 + 11 |
A | 98 | Validate BST |
A | 230 | Kth Smallest in BST | ||
B | 173 | BST Iterator | ||
B | 108 | Sorted Array to BST | ||
| 14. Heap / Priority Queue implicit tree over array |
+ 14. Heap / Priority Queue Wk 4 · Tue Sep 8 implicit tree over array |
A | 215 | Kth Largest in Array |
A | 703 | Kth Largest in Stream | ||
B ⭐ | 295 | Find Median from Data Stream | ||
B ⭐ | 502 | IPO | ||
| 15. Trie builds on 11 |
+ 15. Trie Wk 4 · Wed Sep 9 builds on 11 |
A | 208 | Implement Trie |
A | 211 | Add & Search Words | ||
B | 212 | Word Search II (needs topic 20 — schedule after) |
| 16. Graph DFS builds on 11 + visited set |
+ 16. Graph DFS Wk 4 · Thu Sep 10 builds on 11 + visited set |
A | 200 | Number of Islands |
A | 695 | Max Area of Island | ||
B | 399 | Evaluate Division | ||
B | 261 | Graph Valid Tree | ||
| 17. Graph BFS builds on 12 + visited set — shortest path unweighted |
+ 17. Graph BFS Wk 4 · Fri Sep 11 builds on 12 + visited set — shortest path unweighted |
A | 994 | Rotting Oranges |
A | 127 | Word Ladder | ||
B | 433 | Minimum Genetic Mutation | ||
B | 286 | Walls and Gates | ||
| 18. Topological Sort builds on 16 |
+ 18. Topological Sort Wk 5 · Mon Sep 14 builds on 16 |
A | 207 | Course Schedule |
A | 210 | Course Schedule II | ||
B ⭐ | 269 | Alien Dictionary | ||
B | 1462 | Course Schedule IV | ||
| 19. Union-Find builds on 16's problem class |
+ 19. Union-Find Wk 5 · Tue Sep 15 builds on 16's problem class |
A | 684 | Redundant Connection |
A | 323 | Number of Connected Components | ||
B | 721 | Accounts Merge |
| 20. Backtracking builds on 16 — then unlock LC 212 from topic 15 |
+ 20. Backtracking Wk 5 · Wed Sep 16 builds on 16 — then unlock LC 212 from topic 15 |
A | 78 | Subsets |
A | 39 | Combination Sum | ||
B | 22 | Generate Parentheses | ||
B ⭐ | 52 | N-Queens II | ||
| 21. 1-D Dynamic Programming builds on 20 |
+ 21. 1-D Dynamic Programming Wk 5 · Thu Sep 17 builds on 20 |
A | 70 | Climbing Stairs |
A | 746 | Min Cost Climbing Stairs | ||
B | 91 | Decode Ways | ||
B | 647 | Palindromic Substrings | ||
| 22. Multi-D / Grid DP builds on 21 |
+ 22. Multi-D / Grid DP Wk 5 · Fri Sep 18 builds on 21 |
A | 62 | Unique Paths |
A | 64 | Minimum Path Sum | ||
B | 221 | Maximal Square | ||
B ⭐ | 97 | Interleaving String | ||
| 23. Greedy builds on 21 — includes Kadane's |
+ 23. Greedy Wk 6 · Mon Sep 21 builds on 21 — includes Kadane's |
A | 53 | Maximum Subarray |
A | 55 | Jump Game | ||
B | 918 | Maximum Sum Circular Subarray | ||
B | 763 | Partition Labels | ||
| 24. Intervals builds on 23 |
+ 24. Intervals Wk 6 · Tue Sep 22 builds on 23 |
A | 57 | Insert Interval |
A | 56 | Merge Intervals |