LeetCode HARD 2188 Minimum Time to Finish the Race Summary
Generated by Codex with GPT 5.6 Sol XHigh
Quick facts
- Difficulty:
HARD - Problem: Minimum Time to Finish the Race
- Topics:
Array,Dynamic Programming
Problem gist
Each tire type is described by [f, r]. A fresh tire completes its first lap in f seconds, but keeping it for consecutive laps makes it geometrically slower: its next lap times are f, f * r, f * r^2, and so on. There is an unlimited supply of every tire type. Between laps, the driver may spend changeTime seconds to put on any fresh tire.