Shortest delivery route that avoids dangerous stops
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.
GoogleCodingNo answer yet. Write the first one; the best answer gets endorsed.