You are given an array of distinct positive integers locations where locations[i] represents the position of city i. You are also given integers start, finish and fuel representing the starting city, ending city, and the initial amount of fuel you have, respectively.
At each step, if you are at city i, you can pick any city j such that j != i and 0 <= j < locations.length and move to city j. Moving from city i to city j reduces the amount of fuel you have by |locations[i] - locations[j]|. Please notice that |x| denotes the absolute value of x.
Notice that fuel cannot become negative at any point in time, and that you are allowed to visit any city more than once (including start and finish).
Return the count of all possible routes from start to finish. Since the answer may be too large, return it modulo 109 + 7.
Example 1:
Input: locations = [2,3,6,8,4], start = 1, finish = 3, fuel = 5 Output: 4 Explanation: The following are all possible routes, each uses 5 units of fuel: 1 -> 3 1 -> 2 -> 3 1 -> 4 -> 3 1 -> 4 -> 2 -> 3
Example 2:
Input: locations = [4,3,1], start = 1, finish = 0, fuel = 6 Output: 5 Explanation: The following are all possible routes: 1 -> 0, used fuel = 1 1 -> 2 -> 0, used fuel = 5 1 -> 2 -> 1 -> 0, used fuel = 5 1 -> 0 -> 1 -> 0, used fuel = 3 1 -> 0 -> 1 -> 0 -> 1 -> 0, used fuel = 5
Example 3:
Input: locations = [5,2,1], start = 0, finish = 2, fuel = 3 Output: 0 Explanation: It is impossible to get from 0 to 2 using only 3 units of fuel since the shortest route needs 4 units of fuel.
Constraints:
2 <= locations.length <= 1001 <= locations[i] <= 109locations are distinct.0 <= start, finish < locations.length1 <= fuel <= 200Problem Overview: You are given city locations on a line, a start city, a finish city, and a limited amount of fuel. Moving between cities costs fuel equal to the distance between them. Count how many different routes can reach the finish city without the fuel dropping below zero. Cities can be revisited multiple times.
Approach 1: Recursive Depth-First Search (Exponential Time)
This approach explores every possible path using recursion. From the current city, iterate through all other cities and move if the fuel cost abs(locations[i] - locations[j]) is affordable. Each recursive call represents traveling to another city with reduced fuel. Whenever the current city equals the finish city, increment the route count. Because cities can be revisited, the recursion generates many repeated states, leading to O(n^fuel) worst-case time with O(fuel) recursion stack space. This method helps understand the search space but quickly becomes too slow for large inputs.
Approach 2: Dynamic Programming with Memoization (O(n² * fuel))
The key observation: the state is fully defined by the current city and remaining fuel. If you reach the same city again with the same fuel, the number of routes from that state will always be the same. Use a memo table dp[city][fuel] to cache results. For each state, iterate through all other cities, compute the fuel cost, and recursively count routes if enough fuel remains. Add 1 whenever the current city equals the finish city. Memoization avoids recomputation and collapses the exponential search into O(n² * fuel) time with O(n * fuel) space. This technique is a classic combination of dynamic programming and memoization, where overlapping subproblems are cached during recursion.
The transition looks like: from city i, try traveling to city j. If fuel >= abs(locations[i] - locations[j]), add the result of dfs(j, fuel - cost). Store the result in the DP table so future calls reuse it instantly. The total route count is typically taken modulo 1e9+7 to avoid overflow.
Recommended for interviews: Dynamic Programming with memoization. Interviewers expect you to recognize overlapping subproblems and convert the brute-force DFS into a cached state search. Explaining the naive DFS first shows understanding of the problem space, while the DP optimization demonstrates strong problem-solving skills with arrays and state-based DP.
This approach involves using dynamic programming to keep track of the number of ways to reach the target city with the available fuel. We will define a DP table where dp[i][f] represents the number of ways to start from city i with f units of fuel left and reach the target city. We recursively fill this table while considering moves to any other city and subtracting the appropriate fuel cost for that move. The result will be stored in the dp[start][fuel] after exploring all possible routes.
The C solution uses a top-down dynamic programming approach with memoization. It initializes a 2D array (dp) to store the number of routes. The recursive function explores from the current city to possible destinations, decrementing the fuel and checking if it reaches the finish city. Modulo operation by 10^9 + 7 is applied to avoid overflow.
Time Complexity: O(n * fuel * n), where n is the number of cities. This can be reduced using better states or pruning.
Space Complexity: O(n * fuel) for the dp table.
In this approach, a depth-first search (DFS) is implemented to explore possible routes from the start to the finish city. Each travel option is a branch in the DFS tree, where the algorithm explores each choice of stopping at a different city until it no longer has fuel. The recursion keeps track of current fuel and updates the count whenever it reaches the finish city with valid fuel.
The C solution provides a direct recursive DFS approach without memoizing results. This traverses all possible pathways considering each move and updates the route count if successful. Uses modulo for result consistency.
Time Complexity: O(n^fuel) without pruning, given recursive branching per city. This complexity is potentially high without memoization.
Space Complexity: O(fuel) due to recursive call stack depth.
We design a function dfs(i, k), which represents the number of paths from city i with k remaining fuel to the destination finish. So the answer is dfs(start, fuel).
The process of calculating the function dfs(i, k) is as follows:
k \lt |locations[i] - locations[finish]|, then return 0.i = finish, then the number of paths is 1 at the beginning, otherwise it is 0.j. If j \ne i, then we can move from city i to city j, and the remaining fuel is k - |locations[i] - locations[j]|. Then we can add the number of paths to the answer dfs(j, k - |locations[i] - locations[j]|).To avoid repeated calculations, we can use memoization.
The time complexity is O(n^2 times m), and the space complexity is O(n times m). Where n and m are the size of the array locations and fuel respectively.
Python
Java
C++
Go
TypeScript
We can also convert the memoization of solution 1 into dynamic programming.
We define f[i][k] represents the number of paths from city i with k remaining fuel to the destination finish. So the answer is f[start][fuel]. Initially f[finish][k]=1, others are 0.
Next, we enumerate the remaining fuel k from small to large, and then enumerate all cities i. For each city i, we enumerate all cities j. If j \ne i, and |locations[i] - locations[j]| \le k, then we can move from city i to city j, and the remaining fuel is k - |locations[i] - locations[j]|. Then we can add the number of paths to the answer f[j][k - |locations[i] - locations[j]|].
Finally, we return the number of paths to the answer f[start][fuel].
The time complexity is O(n^2 times m), and the space complexity is O(n times m). Where n and m are the size of the array locations and fuel respectively.
Python
Java
C++
Go
TypeScript
| Approach | Complexity |
|---|---|
| Dynamic Programming with Memoization | Time Complexity: O(n * fuel * n), where n is the number of cities. This can be reduced using better states or pruning. |
| Recursive Depth-First Search | Time Complexity: O(n^fuel) without pruning, given recursive branching per city. This complexity is potentially high without memoization. |
| Memoization | — |
| Dynamic Programming | — |
| Approach | Time | Space | When to Use |
|---|---|---|---|
| Recursive Depth-First Search | Exponential (≈ O(n^fuel)) | O(fuel) | Understanding the raw search space or explaining brute-force reasoning in interviews |
| Dynamic Programming with Memoization | O(n² * fuel) | O(n * fuel) | Optimal solution for constraints where cities and fuel states repeat frequently |
Count All Possible Routes | Recur + Memo | Tree Diagram | ZOHO | Leetcode-1575 | Live Code • codestorywithMIK • 5,012 views views
Watch 9 more video solutions →Practice Count All Possible Routes with our built-in code editor and test cases.
Practice on FleetCodePractice this problem
Open in Editor