Graphs
Traversal, DAGs, shortest paths, spanning trees, connectivity, and flow.
-
Graph Representation & Modeling
Adjacency lists vs matrices vs edge lists, implicit and layered graphs, and spotting a graph problem in disguise.
-
BFS, DFS & Connectivity
BFS shortest paths, DFS edge types, connected components, cycle detection, and bipartite checks.
-
Topological Order & DAGs
Kahn's algorithm and DFS post-order, cycle detection, counting orders, longest paths, and DP on a DAG.
-
Shortest Paths
Dijkstra, Bellman-Ford and negative cycles, Floyd-Warshall, and choosing between them.
-
Minimum Spanning Trees
The cut property, Kruskal with union-find, Prim with a heap, and uniqueness with duplicate weights.
-
SCC, Bridges & Articulation Points
Strongly connected components, bridges and articulation points, 2-SAT, and biconnectivity.
-
Max Flow, Min Cut & Matching
Residual graphs, max-flow min-cut, Edmonds-Karp and Dinic, bipartite matching, and modeling problems as flow.
Up next
25 of 25 questions here are still unsolved.