đź’ˇ Goal: Get just enough theory to understand how each structure works and then immediately apply it with LeetCode problems.
📖 Chapter 2 – Algorithm Complexity (Big O) → Spend ~1.5 hours
📖 Chapter 3 – Arrays & Linked Lists → Spend ~2 hours
📖 Chapter 6 – Stacks & Queues → Spend ~1.5 hours
📖 Chapter 12 – HashMaps & Heaps → Spend ~2.5 hours
📖 Chapter 4, 5, 8 – Trees, BSTs, Graphs → Spend ~3 hours
⏳ Instead of days of reading theory, just get what you need and move on to LeetCode.
| Day | Topic | Weiss Chapters | LeetCode Problems |
|---|---|---|---|
| Day 1 | Complexity + Arrays | Ch. 2, 3 (Skim) | Two Sum, Merge Intervals |
| Day 2 | Linked Lists | Ch. 3 | Reverse Linked List, Detect Cycle |
| Day 3 | Stacks & Queues | Ch. 6 | Valid Parentheses, Min Stack |
| Day 4 | HashMaps & Heaps | Ch. 12 | Top K Frequent Elements, LRU Cache |
| Day 5 | Trees (BST, DFS/BFS) | Ch. 4, 5 | Invert Binary Tree, Level Order Traversal |
| Day 6 | Graphs (DFS/BFS) | Ch. 8 | Number of Islands, Course Schedule |
| Day 7 | Mock OA | No reading | Timed LeetCode contest |
âś… Yes, but only the necessary chapters (~10
hours total max).
🚀 Speed up your prep by immediately practicing after
reading.
❌ Don’t waste time on deep textbook reading—Amazon
won’t test obscure DSA concepts.
Alternative: If you prefer video explanations, replace Weiss with NeetCode + GeeksforGeeks + LeetCode discussions for faster learning.
Would you like a more detailed problem list for your LeetCode prep?