Given two positive integers num1 and num2, find an integer x such that:

• x has the same number of set bits ($1$s in binary representation) as num2.

• The value of x $ ext{XOR}$ num1 is minimized.

Return the integer x.

Constraints:

• $1 \leq$ num1, num2 $\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.