Leetcode 2188. Minimum Time to Finish the Race
Each tire's successive lap times grow multiplicatively and you can swap tires at a fixed changeTime; find the minimum time to complete numLaps by optimally deciding when to change tires. Core idea: precompute the best cost to run k consecutive laps on a fresh tire and use DP to partition the numLaps into such runs.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.