Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
DoorDash
Multi-Source BFS
Reported Apr 30, 2026 · 1 source report
STAFF
Source snapshot: Nov 12, 2026
View source