~/home ~/about ~/projects ~/blog ~/tracker ~/uses ~/contact Sign in

~/home ~/about ~/projects ~/blog ~/tracker ~/uses ~/contact Sign in

DSA Tracker

Sign in with Google to track your progress

Wk 1 · Basics & Foundations Wk 2 · Strings & Advanced Fou

Wk 3 · Linked Lists - Basics Wk 4 · Queues & Binary Trees Wk 5 · Binary Trees Advanced

Wk 6 · Heaps & Graphs Basics Wk 7 · Graph Algorithms & Tri Wk 8 · Union-Find & Phase 3 R

Wk 9 · Dynamic Programming Ba Wk 10 · Dynamic Programming A Wk 11 · Backtracking & Phase

Wk 12 · Timed Sessions & Prac Wk 13 · Practice Rounds 2 & 3 Wk 14 · Final Consolidation &

Wk 15 · Arrays & Hash Maps Wk 16 · Linked Lists & Trees

Wk 17 · Graphs & Dynamic Prog Wk 18 · Backtracking & Final

Week 14: Final Consolidation & Mastery

Sep 3-15 | Phase 5: Practice & Mastery

Day 1-3: Final Consolidation

3-4 hours

📚 Learning

Revisit your Top 20 favourite problems
Re-code from scratch without looking at solutions
Focus on the ones you found hardest

Day 4-5: Edge Cases & Optimization

2-3 hours

📚 Learning

Create optimization notes for array problems
Create optimization notes for string problems
Create optimization notes for tree problems
Create optimization notes for graph problems
Create optimization notes for DP problems

Day 6-7: Final Review & Assessment

2-3 hours

📚 Learning

Can solve easy in <10 mins
Can solve medium in 20-30 mins
Can solve hard in 40-60 mins
Complexity analysis is automatic
Can explain approach clearly
Can ask clarifying questions
Can think out loud
Can handle being stuck gracefully