Available question text
Find the minimum-length sequence of instructions (A: position+=speed, speed*=2; R: reverse to ±1) to move a car from 0 with initial speed +1 to a given target, where the challenge is to optimize between exponentially growing accelerations and strategic reversals (often solved with BFS/DP or a greedy DP using binary/overshoot patterns).
Related questions
Continue with questions that share topics or the same question type.
- Car Fleet
Coding
- Car Fleet II
Coding
- Car Pooling
Coding
- Car Rental Optimization
Coding
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 818. Race Car
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source