You are given two integers n and x. You must construct an array of positive integers nums of size n such that:

• nums is strictly increasing.

• The bitwise AND of all elements in nums is equal to x.

Return the minimum possible value of nums[n - 1].

Constraints:

• $1 \leq$ n, x $\leq 10^8$

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.