Multi-Source BFS
Implement a breadth-first search algorithm that starts simultaneously from multiple source nodes in a graph. Return the shortest distances from any source node to all other reachable nodes.
Asked at:
DoorDash
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Late April, 2026
DoorDash
Staff
Hello Interview Premium
Your account is free and you can post anonymously if you choose.