← Samsung questions

Shortest path in graph using DFS and BFS

Filed under Samsung

Explain whether Depth-First Search (DFS) and Breadth-First Search (BFS) can be used to compute the shortest distance between two nodes in a graph, analyzing specifically the mechanics of DFS in this…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related Samsung questions

Collected from public candidate posts and coding forums. Updated Nov 2026.