2419. Longest Subarray With Maximum Bitwise AND LeetCode Solution
In this guide, you will get 2419. Longest Subarray With Maximum Bitwise AND LeetCode Solution with the best time and space complexity. The solution to Longest Subarray With Maximum Bitwise AND problem is provided in various programming languages like C++, Java, and Python. This will be helpful for you if you are preparing for placements, hackathons, interviews, or practice purposes. The solutions provided here are very easy to follow and include detailed explanations.
Problem Statement of 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 k be the maximum value of the bitwise AND of any subarray of nums. Then, only subarrays with a bitwise AND equal to k should 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: 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.
2419. Longest Subarray With Maximum Bitwise AND LeetCode Solution in C++
class Solution {
public:
int longestSubarray(vector<int>& nums) {
int ans = 0;
int maxIndex = 0;
int sameNumLength = 0;
for (int i = 0; i < nums.size(); ++i)
if (nums[i] == nums[maxIndex]) {
ans = max(ans, ++sameNumLength);
} else if (nums[i] > nums[maxIndex]) {
maxIndex = i;
sameNumLength = 1;
ans = 1;
} else {
sameNumLength = 0;
}
return ans;
}
}; /* code provided by PROGIEZ */
2419. Longest Subarray With Maximum Bitwise AND LeetCode Solution in Java
class Solution {
public int longestSubarray(int[] nums) {
int ans = 0;
int maxIndex = 0;
int sameNumLength = 0;
for (int i = 0; i < nums.length; ++i)
if (nums[i] == nums[maxIndex]) {
ans = Math.max(ans, ++sameNumLength);
} else if (nums[i] > nums[maxIndex]) {
maxIndex = i;
sameNumLength = 1;
ans = 1;
} else {
sameNumLength = 0;
}
return ans;
}
} // code provided by PROGIEZ
2419. Longest Subarray With Maximum Bitwise AND LeetCode Solution in Python
class Solution:
def longestSubarray(self, nums: list[int]) -> int:
ans = 0
maxIndex = 0
sameNumLength = 0
for i, num in enumerate(nums):
if nums[i] == nums[maxIndex]:
sameNumLength += 1
ans = max(ans, sameNumLength)
elif nums[i] > nums[maxIndex]:
maxIndex = i
sameNumLength = 1
ans = 1
else:
sameNumLength = 0
return ans # code by PROGIEZ
