Try to solve the Minimum Number of Refueling Stops problem.
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]
, where ...