# Minimum Time To Finish The Race: Walkthrough
Minimum Time To Finish The Race shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
numLaps laps; changeTime to change tires; tires[i]=(fi, ri) gives the time of the k-th consecutive lap on that tire as fi*ri^{k-1}. Precompute best[k] = fastest way to run k consecutive laps without a change (try every tire until the geometric term is worse than changing). Then DP dp[laps] = min over k of dp[laps-k] + changeTime + best[k].
## 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(numLaps * L) with L small (~18).
## Common mistake
Using one tire the whole race, or treating the geometric growth as linear.
## 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 real-time AI interview assistant for live interviews.