Longest Subarray With Maximum Bitwise AND
You are given an integer array nums of size n.
Consider a non-empty subarray from nums that has the maximum possible bitwise AND.
- In other words, let
kbe the maximum value of the bitwise AND of any subarray ofnums. Then, only subarrays with a bitwise AND equal tokshould be considered.
Return the length of the longest such subarray.
The bitwise AND of an array is the bitwise AND of all the numbers in it.
A subarray is a contiguous sequence of elements within an array.
Example 1
Input
nums = [1,2,3,3,2,2]Output
2The maximum possible bitwise AND of a subarray is 3, and the longest subarray with that value is [3,3].
Example 2
Input
nums = [1,2,3,4]Output
1The maximum possible bitwise AND of a subarray is 4, and the longest subarray with that value is [4].
Constraints
- 1 <= nums.length <= 10^5
- 1 <= nums[i] <= 10^6