Given a graph, find the shortest path between two nodes.
Anonymous
I asked if the graph's edges are weighted? Interviewer answered yes. Then I knew it's a Dijkstra's. I explained how the algorithm works and wrote code for the same.
Check out your Company Bowl for anonymous work chats.