Which graph algorithm the question is actually asking for
8 min read The wording of a graph problem tells you whether to reach for BFS, DFS, topological sort, union-find, or Dijkstra. Read article
8 min read The wording of a graph problem tells you whether to reach for BFS, DFS, topological sort, union-find, or Dijkstra. Read article
4 min read Minimum Spanning Tree problems test whether you can connect all nodes in a weighted graph at minimum total cost — Read article
4 min read Cycle detection is asked in interviews at Google, Meta, Amazon, and anywhere that tests graphs. The classic application is deadlock Read article
4 min read Number of Islands (LeetCode 200) is the most common entry-level graph problem in technical interviews. It appears at Google, Amazon, Read article
What's missing, wrong, or worth adding? One line helps.
Sent — thank you. We read every one.