Find Subarray With Bitwise OR Closest to K
You are given an array nums and an integer k. You need to find a subarray of nums such that the absolute difference between k and the bitwise OR of the subarray elements is as small as possible. In other words, select a subarray nums[l..r] such that |k - (nums[l] OR nums[l + 1] ... OR nums[r])| is minimum.
Return the minimum possible value of the absolute difference.
A subarray is a contiguous non-empty sequence of elements within an array.
Example 1
Input
nums = [1,2,4,5], k = 3Output
0The subarray
nums[0..1] has OR value 3, which gives the minimum absolute difference |3 - 3| = 0.Example 2
Input
nums = [1,3,1,3], k = 2Output
1The subarray
nums[1..1] has OR value 3, which gives the minimum absolute difference |3 - 2| = 1.Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^9
- 1 <= k <= 10^9