~/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 12: Timed Sessions & Practice Round 1

Aug 20-26 | Phase 5: Practice & Mastery

Day 1-2: Timed Problem Sessions

2-3 hours

📚 Learning

Session 1: 15 mins per easy, 25 mins per medium

🔗 LeetCode

1. Two Sum (15 mins) Easy
2. Add Two Numbers (25 mins) Medium
3. Longest Substring Without Repeating Characters (20 mins) Medium
5. Longest Palindromic Substring (30 mins) Medium

Day 3-4: Practice Round 1

2-3 hours

📚 Learning

Format: 90 minutes, 2 medium problems, no hints
Pick 2 random LeetCode mediums you haven't seen
After: Did I solve both within time?
After: Were my solutions optimal?
After: Did I communicate my approach?

Day 5-7: Weakness Mitigation

3 hours

📚 Learning

Identify 3 topics where you struggled in Mock 1
Practice 3 problems per weak topic
Focus on explaining approach out loud