Smallest Subarrays With Maximum Bitwise OR
You receive a 0-indexed array nums of length n, consisting of non-negative integers. For each index i from 0 to n - 1, you must determine the size of the minimum sized non-empty subarray of nums starting at i (inclusive) that has the maximum possible bitwise OR.
- In other words, let
B ijbe the bitwise OR of the subarraynums[i...j]. You need to determine the smallest subarray starting ati, such that bitwise OR of this subarray is equal tomax(B ik )wherei <= k <= n - 1.
The bitwise OR of an array is the bitwise OR of all the numbers in it.
Produce an integer array answer of size n where answer[i] is the length of the minimum sized subarray starting at i with maximum bitwise OR.
A subarray is a contiguous non-empty sequence of elements within an array.
Input: nums = [1,0,2,1,3]
Output: [3,3,2,2,1]
Explanation: The maximum possible bitwise OR starting at any index is 3.
-
Starting at index 0, the shortest subarray that yields it is [1,0,2].
-
Starting at index 1, the shortest subarray that yields the maximum bitwise OR is [0,2,1].
-
Starting at index 2, the shortest subarray that yields the maximum bitwise OR is [2,1].
-
Starting at index 3, the shortest subarray that yields the maximum bitwise OR is [1,3].
-
Starting at index 4, the shortest subarray that yields the maximum bitwise OR is [3].
Therefore, we produce [3,3,2,2,1].
Input: nums = [1,2]
Output: [2,1]
Explanation: Starting at index 0, the shortest subarray that yields the maximum bitwise OR is of length 2.
Starting at index 1, the shortest subarray that yields the maximum bitwise OR is of length 1.
Therefore, we produce [2,1].
Constraints
n == nums.length1 <= n <= 10^50 <= nums[i] <= 10^9
Did this problem appear in one of your interviews?
Responses stay private.