Interactive Checklist: Track your progress locally. Your selections will persist when you check items!
0 / 53 Done
🟢 Module 1: The Core Foundations
1. Arrays & Hashing (The STL Warmup)
2. Two Pointers & Sliding Window
3. Binary Search
🟡 Module 2: Classic Data Structures & Recursion
4. Linked Lists
5. Stacks & Queues
6. Recursion & Backtracking
🔴 Module 3: Hierarchical & Advanced Algorithms
7. Trees & Binary Search Trees (BST)
8. Heaps & Priority Queues
9. Graphs
10. Dynamic Programming