~/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 6: Heaps & Graphs Basics

Sep 27 - Oct 3 | Phase 3: Advanced Data Structures

Day 1-2: Heaps & Priority Queues

2-3 hours

📚 Learning

Min-heap and max-heap
heapq module in Python
heappush, heappop, heapify

🔗 LeetCode

703. Kth Largest Element in a Stream Easy
1046. Last Stone Weight Easy
215. Kth Largest Element in an Array Medium

🎯 HackerRank

QHEAP1 Easy

Day 3-4: Heaps - Advanced

3-4 hours

📚 Learning

Median of data stream
Top K problems
Merge K sorted lists

🔗 LeetCode

295. Find Median from Data Stream Hard
23. Merge k Sorted Lists Hard
347. Top K Frequent Elements Medium

Day 5-7: Graphs - Basics

3-4 hours

📚 Learning

Graph representation (adjacency list, matrix)
DFS traversal on graphs
BFS traversal on graphs
Connected components

🔗 LeetCode

200. Number of Islands Medium
733. Flood Fill Easy
695. Max Area of Island Medium

🎯 HackerRank

DFS: Connected Cell in a Grid Medium