BFS / DFS3 articles
BFS / DFS
BFS and DFS are the building blocks of graph and tree problems. BFS finds shortest paths; DFS finds connected components.
Binary Tree Interview Questions — return values where candidates drown
Most tree-round failures are not recursion bugs. They are helper-contract bugs. Here are the engineers, textbooks, and open-source trees that teach the return-value discipline tree rounds actually grade on.
Fin · Apr 17, 2026
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
Queue interviews test FIFO state, simpler than candidates think
A practical queue interview prep guide for software engineers: the queue question families that repeat, the state mistakes that waste time, and the short drill plan that makes queue-heavy rounds feel predictable.
Fin · Apr 10, 2026