Graphs2 articles
Graphs
Graph problems combine traversal with state tracking. Topological sort, shortest path, and union-find cover most interview questions.
Related:BFS / DFS
Five graph shapes and I've seen them all
BFS and DFS are the same algorithm with a different container. That reframe, plus five shape-names, covers most graph coding rounds. Here are the engineers and open textbooks that taught it.
Fin · Apr 17, 2026
Topological Sort Interview Questions for Software Engineers: In-Degree, Cycles, and Build-Order Judgment
A practical topological sort interview prep guide for software engineers: the dependency-order question families that repeat, the graph-construction mistakes that waste time, and the short drill plan that makes DAG rounds feel predictable.
Fin · Apr 10, 2026