mirror of
https://github.com/prdlk/leetcode.git
synced 2026-09-16 23:16:26 +00:00
43 KiB
43 KiB
Campaign
8-week interview-prep fight camp. Each phase is a milestone; each topic an issue; each problem a sub-issue. Core count reflects closed sub-issues.
| 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 |
Phase I — Linear Structures (Week 1)
Phase II — Nodal & Grid Structures (Week 2)
| Topic | Set | LC # | Problem |
|---|---|---|---|
| 8. Linked List independent primitive |
A | 206 | Reverse Linked List |
A | 21 | Merge Two Sorted Lists | |
A | 141 | Linked List Cycle | |
A | 19 | Remove Nth Node From End | |
A | 143 | Reorder List | |
B | 876 | Middle of the Linked List | |
B | 92 | Reverse Linked List II | |
B | 82 | Remove Duplicates from Sorted List II | |
B | 61 | Rotate List | |
B | 86 | Partition List | |
| 9. Hybrid Structures 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 |
A | 48 | Rotate Image |
A | 54 | Spiral Matrix | |
A | 73 | Set Matrix Zeroes | |
B | 36 | Valid Sudoku | |
B | 289 | Game of Life |
Phase III — Hierarchical Structures (Week 3)
Phase IV — Relational Structures (Week 4)
| Topic | Set | LC # | Problem |
|---|---|---|---|
| 16. Graph DFS builds on 11 + visited set |
A | 200 | Number of Islands |
A | 695 | Max Area of Island | |
A | 133 | Clone Graph | |
A | 417 | Pacific Atlantic Water Flow | |
A | 130 | Surrounded Regions | |
B | 399 | Evaluate Division | |
B | 261 | Graph Valid Tree | |
| 17. Graph BFS builds on 12 + visited set — shortest path unweighted |
A | 994 | Rotting Oranges |
A | 127 | Word Ladder | |
B | 909 | Snakes and Ladders | |
B | 433 | Minimum Genetic Mutation | |
B | 286 | Walls and Gates | |
| 18. Topological Sort 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 |
A | 684 | Redundant Connection |
A | 323 | Number of Connected Components | |
B | 128 | Longest Consecutive (union-find variant) | |
B | 721 | Accounts Merge |