Waymo Tech Phone Screen: Classic Dijkstra Shortest Path Problem

Interview covers a classic Dijkstra algorithm problem to find the shortest path from a start node to target nodes based on given distances.