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