Longest Subarray With Maximum Bitwise AND
Medium
You receive an integer array nums of size n .
Consider a non-empty sublist from nums that has the maximum possible bitwise AND .
- In other words, let
kbe the maximum value of the bitwise AND of any sublist ofnums. Then, only subarrays with a bitwise AND equal tokshould be considered.
Produce the length of the longest such subarray .
The bitwise AND of an list is the bitwise AND of all the numbers in it.
A sublist is a contiguous sequence of elements within an array.
Example 1
Input: nums = [1,2,3,3,2,2]
Output: 2
Explanation: The maximum possible bitwise AND of a subarray is 3.
The longest subarray with that value is [3,3], so we return 2.
Example 2
Input: nums = [1,2,3,4]
Output: 1
Explanation: The maximum possible bitwise AND of a subarray is 4.
The longest subarray with that value is [4], so we return 1.
Constraints
1 <= nums.length <= 10^51 <= nums[i] <= 10^6
Did this problem appear in one of your interviews?
Responses stay private.