# Count All Possible Routes: Interview Notes

Count All Possible Routes shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

locations[i] on a line, start, finish, fuel. A route may visit any city (repeats allowed) as long as fuel never goes negative; cost is |locations[i]-locations[j]|. DP memo (city, fuel_left): 1 if city==finish (empty continuation counts) plus sum over other cities you can still reach. Mod 1e9+7.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n^2 * fuel).

## Common mistake

Forbidding revisits, or subtracting fuel without the absolute-distance cost.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at Linkjob AI interview assistant.