← Questions
Shortest delivery route that avoids dangerous stops
0
I was asked this
No reports yet. Sign in to say where you were asked it.
A delivery network is a graph of stops, and some stops are marked dangerous. Find the shortest route from the depot to the destination that avoids the dangerous stops (or limits how many you pass through, if the interviewer allows some). Choose BFS or Dijkstra depending on the edge weights.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding