Part XII · Algorithm Engineering, Java Practice and Tutorial Publishing
71. Practice Roadmap and Progressive Assessments
7 lessons•47 topics•Beginner to Expert
0 of 7 lessons published
71.01Outline
Phase 1: beginner
- Programming and complexity
- Arrays
- Strings
- Sorting basics
- Linear/binary search
- 30-50 easy problems
71.02Outline
Phase 2: core structures
- Linked lists
- Stacks
- Queues
- Hashing
- Recursion
- Two pointers/windows
- 50-70 problems
71.03Outline
Phase 3: algorithm patterns
- Greedy
- Backtracking
- Heaps
- Trees
- Graph BFS/DFS
- Intro DP
- 60-80 problems
71.04Outline
Phase 4: intermediate
- Binary search on answer
- Trie
- Disjoint set
- Dijkstra
- MST
- KMP
- Fenwick/segment tree
- 60-80 problems
71.05Outline
Phase 5: advanced
- Tree algorithms
- Advanced DP
- Flow
- SCC
- String indexing
- Number theory
- Geometry
- 60-100 problems
71.06Outline
Assessment format
- Concept quiz
- Manual dry run
- Implementation from scratch
- Complexity proof
- Timed problem
- Code review
71.07Outline
Revision and progress
- Spaced repetition
- Pattern journal
- Error log
- Complexity cheat sheet
- Re-implement without notes