~/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 4: Queues & Binary Trees

Nov 4-10 | Phase 2: Core Structures

Day 1-3: Queues & Deques

2-3 hours

📚 Learning

Queue implementation
collections.deque
FIFO principle
Sliding window maximum

🔗 LeetCode

232. Implement Queue using Stacks Easy
933. Number of Recent Calls Easy
239. Sliding Window Maximum Hard

🎯 HackerRank

Queue using Two Stacks Medium

Day 4-5: Binary Trees - Basics

2-3 hours

📚 Learning

Tree node structure
Inorder, preorder, postorder traversals
BFS (level-order traversal)

🔗 LeetCode

94. Binary Tree Inorder Traversal Easy
144. Binary Tree Preorder Traversal Easy
102. Binary Tree Level Order Traversal Medium

Day 6-7: Tree Traversals - DFS

2-3 hours

📚 Learning

Recursive DFS
Iterative DFS
Path problems

🔗 LeetCode

112. Path Sum Easy
404. Sum of Left Leaves Easy
113. Path Sum II Medium