BFS vs DFS: When to Use Each with Examples
5 min read BFS and DFS are the two foundational graph traversal algorithms. Every other graph algorithm — Dijkstra, Bellman-Ford, topological sort, cycle […] Read article
Graphs
newsletter
What's actually being asked right now
Interview patterns & comp trends, straight to your inbox.
No spam. Unsubscribe anytime.
worth a read
Mars For The Rest of Us — a weekly-or-more deep dive on the technical side of Mars exploration: rocket propulsion, microbiology, mission architecture, and everything in between. Written by Maciej Ceglowski.
Read it on Substack →