Roadmap / 001
Data structures & algorithms, made navigable.
A deliberate path from first principles to confident problem solving. Small loops, strong patterns, no random problem hunting.
Start the roadmap ->For the curious engineer who wants to understand the shape of the problem before reaching for the code.
02 / 04The progression
Four chapters. One reliable rhythm.
Each chapter earns the next. Spend enough time with a pattern that it starts to feel familiar.
01Weeks 1-3
Build the base
- Complexity + recursion
- Arrays and strings
- Hash maps and sets
->
02Weeks 4-7
Think in patterns
- Two pointers + sliding window
- Stacks and queues
- Binary search + linked lists
->
03Weeks 8-10
Level up
- Trees and heaps
- Graphs and traversal
- Backtracking + greedy
->
04Weeks 11-12
Interview ready
- Dynamic programming
- Mixed timed sets
- Mock interviews + review
->
The weekly plan
Consistency beats intensity.
Five focused sessions and one honest review. Keep the loop small enough to repeat, even on a busy week.
“The goal is not to memorize solutions. It is to recognize the next useful question.”
DayModeSession
MonLearnOne pattern, deeply
TueDrill3 easy problems
WedApply2 medium problems
ThuReviewRewrite from memory
FriStretch1 timed challenge
SatReflectError log + recap