Algorithm · Rippling · Hard
Problem Description You are given multiple delivery requests, where every request specifies a pickup location and a drop-off location. Locations lie on a line, and travel time between two locations is the absolute difference between their coordinates. Determine a route that finishes every request in the minimum possible time, then report that minimum time. The total time includes travel while carrying a delivery and empty travel between the drop-off location of one request…
Checking your access…