Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2188. Minimum Time to Finish the Race
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source