BFS vs DFS

Easy

computer-science Meta Uber

When is BFS preferred over DFS for graph traversal?

Multiple Choice

When you want to find the shortest path in an unweighted graph When the graph has cycles and you want to avoid them When memory is extremely limited When you need to detect strongly connected components

Correct!

Incorrect — try again next time!

Upgrade to Pro to unlock solutions and explanations

BFS vs DFS

Multiple Choice

Related problems

Deep-dive guides