Graphs — DSA Interview Problems

Graphs is nodes and edges that model the hardest and most general interview problems, and it shows up very frequently in technical interviews. Graph questions test BFS/DFS, cycle detection, topological sort, and shortest-path reasoning.

Our library indexes 34 Graphs problems (0 easy, 32 medium, 2 hard), each solved brute-force → optimal in Java and Python with a line-by-line walkthrough and interview talking points. They're grouped below by the curriculum module that teaches the underlying pattern, so related problems reinforce one another.

If you remember one thing about Graphs, make it this: Many problems that don't mention graphs are graphs in disguise — model the states as nodes and transitions as edges. Once that clicks, the signature patterns — BFS, DFS, topological sort, union-find — start to feel like a checklist you run on every new problem.