Mixed disciplines every week: 2 days DSA · 2 days LLD · 2 days HLD · 1 revision. Problems progress from easy → medium → hard. Start a roadmap, mark days as you go.
DSA — Arrays: intuition + easy problems
DSA — Arrays medium + Linked List intro
LLD — Inheritance, Polymorphism & Relationships
Revision — Week 1
DSA — Linked Lists: medium problems
DSA — Two Pointers: easy → medium
Revision — Week 2
DSA — Sliding Window: fixed & variable
DSA — Sliding Window hard + Stack easy/medium
Revision — Week 3
DSA — Monotonic Stack
DSA — Binary Search: easy → hard
Revision — Week 4
DSA — Binary Trees: easy → medium
DSA — BFS: trees & grids
LLD — Proxy, Adapter & Decorator Patterns
Revision — Week 5
DSA — DFS: tree paths & backtracking
DSA — Graphs: traversal, cycle detection & topo sort
LLD — Snake & Ladder + Meeting Scheduler
Revision — Week 6 (Mid-point!)
DSA — Union Find: components & connectivity
DSA — Greedy: intervals & scheduling
Revision — Week 7
DSA — DP: linear 1D
DSA — DP: knapsack & unbounded
DSA — DP: sequences [extra DSA day]
Revision — Week 8
DSA — DP: grid problems
DSA — Sorting algorithms
Revision — Week 9
DSA — Backtracking
DSA — Hard mixed (Trapping Rain + Largest Histogram)
LLD — Iterator, Chain of Responsibility & Visitor
Revision — Week 10
DSA — Heaps & Priority Queues
DSA — Shortest Path algorithms
LLD Revision — State Machines round-up
LLD Revision — Booking & Finance round-up
Revision — Week 11
Revision DSA — Arrays, Pointers, Window
Revision LLD — State Machines & Patterns
Revision HLD — Foundations & Scale
Revision HLD — Systems
🎯 Final Mock Prep