Search⌘ K
AI Features

Solution: Minimum Number of Refueling Stops

Solution: Minimum Number of Refueling Stops asks you to reach a target distance with starting fuel and sorted stations giving locations and fuel, returning the fewest stops or failure if impossible.

Statement

You need to find the minimum number of refueling stops that a car needs to make to cover a distance, target. For simplicity, assume that the car has to travel from west to east in a straight line. There are various fuel stations on the way that are represented as a 2-D array of stations, i.e., stations[i] =[di,fi]= [d_i, f_i] ...