Shortest Path from Source to Target Nodes (Dijkstra)

Question

Classic Dijkstra phone screen: given a source node, a set of target nodes, and weighted edges between nodes, return the shortest distance from source to all targets (or the minimum over targets, depen...

Waymo interview candidates · Answer

Community-reported Waymo interview question with 1 related discussion. The full write-up and related discussions are available to members.

Comments