Leetcode 818. Race Car

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).

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 818. Race Car

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact