Given two integers start and goal, determine the minimum number of bit flips needed to transform start into goal.

A bit flip of a number entails changing a single bit in its binary representation from $0$ to $1$ or from $1$ to $0$.

Constraints:

• $0 \leq$ start, goal $\leq 10^9$

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.