Advanced
Graphs
Model anything with connections (maps, grids, dependencies, networks) as a graph, then explore it with DFS and BFS, order it with topological sort, group it with union–find and find cheapest routes with Dijkstra.
0 of 3 lessons complete, 0 of 8 problems solved
Coursework
41 min
Up next
Graphs, Grids & Traversal
Build an adjacency list, treat grids as graphs, and explore with DFS and BFS.
14 min
Shortest Paths & Topological Sort
BFS for fewest steps, multi-source BFS, and ordering dependencies with Kahn's algorithm.
14 min
Union–Find & Dijkstra
Merge groups in near-O(1) with union–find, and find cheapest weighted paths with a heap.
13 min
Practice ladder
Start with the first problem, then work toward the harder variations. Run examples before submitting against all tests.
Next unit: Dynamic Programming