Minimum Number of Refueling Stops
Try to solve the Minimum Number of Refueling Stops problem.
We'll cover the following
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 is the distance (in miles) of the gas station from the starting position, and is the amount of fuel (in liters) that it stores. Initially, the car starts with k
liters of fuel. The car consumes one liter of fuel for every mile traveled. Upon reaching a gas station, the car can stop and refuel using all the petrol stored at the station. If it cannot reach the target, the program returns .
Note: If the car reaches a station with fuel left, it can refuel from that station, and all the fuel from that station can be transferred to the car. If the car reaches the target with fuel left, it is still considered to have arrived.
Constraints:
-
target
,k
-
stations.length
-
target
Examples
Create a free account to view this lesson.
By signing up, you agree to Educative's Terms of Service and Privacy Policy