Your car starts at position $0$ with speed $1$ on an infinite number line. Given the target position target, return the minimum number of instructions needed for the car to reach that position.

The car accepts two instructions:

• A accelerates the car. Its position increases by its current speed, then its speed doubles.

• R reverses the car. Its position remains unchanged, and its speed becomes $-1$ if it was positive or $1$ if it was negative.

Implement def racecar(self, target): to return the length of the shortest instruction sequence that moves the car to target.

Constraints:

• $1 \leq$ target $\leq 10^4$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.