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

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

DSA Tracker

0%

Apr 07 → Jul 20, 2026 on track

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 11: Backtracking & Phase 4 Review

Jun 16-22 | Phase 4: Algorithms & Advanced Problem-Solving

Day 1-2: Backtracking

2-3 hours

📚 Learning

Backtracking pattern
Permutations and combinations
Pruning techniques

🔗 LeetCode

46. Permutations Medium
77. Combinations Medium
78. Subsets Medium

🎯 HackerRank

Recursive Digit Sum Medium

📝 Reflection / Notes:

Day 3-4: Backtracking - Advanced

3-4 hours

📚 Learning

N-Queens problem
Sudoku solver
Palindrome partitioning

🔗 LeetCode

51. N-Queens Hard
37. Sudoku Solver Hard
79. Word Search Medium

📝 Reflection / Notes:

Day 5-7: Phase 4 Review & Consolidation

3-4 hours

📚 Learning

Identify when to use DP vs Greedy

🔗 LeetCode

313. Super Ugly Number Medium
264. Ugly Number II Medium

🔄 Review

Climbing Stairs
Coin Change
Longest Increasing Subsequence
Permutations
N-Queens

📝 Reflection / Notes: