Learning pathalgorithmsdata-structures
Graph Algorithms Path
A focused route through graph representation, BFS/DFS reasoning, union-find, shortest paths, cycle detection, and deploy ordering.
Path reward
Graph Runner
Interview candidates and competitive programmers who want graph confidence instead of memorized templates.
Demo progress: start the first mission to begin tracking.
Graph reader
Translate stories into nodes, edges, and invariants. Required clears: 2.
Traversal tactician
Choose BFS/DFS/union-find/heap based on the signal. Required clears: 5.
Dungeon ready
Handle cycles, stale heap entries, and adversarial graph shapes. Required clears: 8.
Mission chain
Step 1
Warm up with Dijkstra latency route
Easy Algorithms arena: weighted graphs, priority queues, and stale heap entries
Step 2
Warm up with union-find connectivity
Easy Data Structures arena: path compression, union by rank, and component counts
Step 3
Stabilize Dijkstra latency route
Medium Algorithms arena: weighted graphs, priority queues, and stale heap entries
Step 4
Harden Dijkstra latency route
Hard Algorithms arena: weighted graphs, priority queues, and stale heap entries
Step 5
Harden union-find connectivity
Hard Data Structures arena: path compression, union by rank, and component counts
Step 6
Harden topological deploy order
Hard Algorithms arena: DAG ordering, cycle detection, and dependency resolution
Step 7
Rescue topological deploy order
Extreme Algorithms arena: DAG ordering, cycle detection, and dependency resolution
Step 8
Master Dijkstra latency route
Insane Algorithms arena: weighted graphs, priority queues, and stale heap entries