LeetCode | 3133. Minimum Array End | Bit Manipulation

You are given two integers n and x. You have to construct an array of positive integers nums of size n where for every 0 less than equal i less than n - 1, nums[i + 1] is greater than nums[i], and the result of the bitwise AND operation between all elements of nums is x.

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

#leetcode #leetcodechallenge #bitmanipulation