mediumBit Manipulation 0 views
Minimum Array End
You are given two integers n and x.
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 <= i < 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].
Example 1
Input: n = 3, x = 4
Output: 6
Explanation: nums can be [4,5,6] and its last element is 6.
Example 2
Input: n = 2, x = 7
Output: 15
Explanation: nums can be [7,15] and its last element is 15.
Constraints
- 1 <= n, x <= 10^8
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.