~/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 9: Dynamic Programming Basics

Jun 2-8 | Phase 4: Algorithms & Advanced Problem-Solving

Day 1-3: Dynamic Programming - Basics

2-3 hours

📚 Learning

Memoization approach
Tabulation approach
State definition and transitions
Always start with recursive brute-force O(2^n), then add memoization O(n)

🔗 LeetCode

70. Climbing Stairs Easy
509. Fibonacci Number Easy
121. Best Time to Buy and Sell Stock Easy

🎯 HackerRank

Fibonacci Modified Medium

📝 Reflection / Notes:

Day 4-5: DP - 0/1 Knapsack & Variants

3-4 hours

📚 Learning

0/1 Knapsack problem
Unbounded knapsack
Subset sum

🔗 LeetCode

322. Coin Change Medium
518. Coin Change 2 Medium
416. Partition Equal Subset Sum Medium

🎯 HackerRank

Coin Change Medium

📝 Reflection / Notes:

Day 6-7: DP - Subsequences

3-4 hours

📚 Learning

Longest Increasing Subsequence (LIS)
Longest Common Subsequence (LCS)

🔗 LeetCode

300. Longest Increasing Subsequence Medium
1143. Longest Common Subsequence Medium
97. Interleaving String Medium

📝 Reflection / Notes: