~/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 8: Union-Find & Phase 3 Review

May 26 - Jun 1 | Phase 3: Advanced Data Structures

Day 1-3: Union-Find & Advanced Graphs

3-4 hours

📚 Learning

Union-Find (Disjoint Set Union)
Connected components with Union-Find
MST (Minimum Spanning Tree) concept

🔗 LeetCode

721. Accounts Merge Medium
547. Number of Provinces Medium
1202. Smallest String With Swaps Medium

📝 Reflection / Notes:

Day 4-7: Phase 3 Review & Consolidation

3-4 hours

📚 Learning

Revisit all heap problems
Practice all graph algorithms
Solidify trie implementation

🔗 LeetCode

399. Evaluate Division Medium
1615. Maximal Network Rank Medium

🔄 Review

Kth Largest Element
Number of Islands
Course Schedule
Implement Trie

📝 Reflection / Notes: