Graphs
BFS · DFS · Union-Find · DijkstraGraph problems test whether you can model a problem as nodes and edges, then pick the right traversal. Grid problems are graphs in disguise. Know: BFS for shortest unweighted paths, DFS for connectivity, topological sort for dependencies, Union-Find for components, and Dijkstra for weighted shortest paths.
8 problems