~/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 7: Graph Algorithms & Tries

May 19-25 | Phase 3: Advanced Data Structures

Day 1-3: Graph Algorithms

3-4 hours

📚 Learning

Topological sort
Cycle detection
Bipartite checking

🔗 LeetCode

207. Course Schedule Medium
210. Course Schedule II Medium
785. Is Graph Bipartite? Medium

🎯 HackerRank

BFS: Shortest Reach in a Graph Hard

📝 Reflection / Notes:

Day 4-5: Shortest Path & Advanced Graphs

3-4 hours

📚 Learning

Dijkstra's algorithm
Bellman-Ford (concept)
Floyd-Warshall (concept)

🔗 LeetCode

743. Network Delay Time Medium
1631. Path With Minimum Effort Medium
787. Cheapest Flights Within K Stops Medium

📝 Reflection / Notes:

Day 6-7: Tries

2-3 hours

📚 Learning

Trie node structure
Insert, search, delete
Autocomplete

🔗 LeetCode

208. Implement Trie (Prefix Tree) Medium
211. Design Add and Search Words Data Structure Medium
212. Word Search II Hard

📝 Reflection / Notes: