How hard is LeetCode 2419. Longest Subarray With Maximum Bitwise AND?

LeetCode 2419. Longest Subarray With Maximum Bitwise AND is rated Medium on LeetCode.

What is the time complexity of LeetCode 2419. Longest Subarray With Maximum Bitwise AND?

The Python solution on this page runs in O(n), where n is the length of the array \textit{nums}.

What is the space complexity of LeetCode 2419. Longest Subarray With Maximum Bitwise AND?

The Python solution on this page uses O(1) auxiliary space.

What topics does LeetCode 2419. Longest Subarray With Maximum Bitwise AND cover?

LeetCode 2419. Longest Subarray With Maximum Bitwise AND is tagged Bit Manipulation, Brainteaser and Array on LeetCode.

Longest Subarray With Maximum Bitwise AND — LeetCode 2419 Python Solution

MediumBit ManipulationBrainteaserArray

Problem: #2419
Pattern: Bit Manipulation
Reading time: 2 min
Source: leetcode.com

The problem

You are given an integer array nums of size n. Consider a non-empty subarray from nums that has the maximum possible bitwise AND.

Example

Input: nums = [1,2,3,3,2,2]
Output: 2
Explanation: The maximum possible bitwise AND of a subarray is 3.

Python solution

Python

class Solution:
    def longestSubarray(self, nums: List[int]) -> int:
        mx = max(nums)
        ans = cnt = 0
        for x in nums:
            if x == mx:
                cnt += 1
                ans = max(ans, cnt)
            else:
                cnt = 0
        return ans

Complexity

Measure	Complexity
Time	O(n), where n is the length of the array \textit{nums}
Space	O(1) auxiliary

Pattern: Bit Manipulation

Use XOR, masks and the low-bit trick to replace whole data structures with an integer. LeetCode 2419. Longest Subarray With Maximum Bitwise AND is filed here on both counts: the reference solution below belongs to the algorithm family this hub collects, and LeetCode tags it Bit Manipulation.

The bit manipulation guide has the Python template for the pattern and the 194 LeetCode problems that use it.

Frequently asked questions

How hard is LeetCode 2419. Longest Subarray With Maximum Bitwise AND?: LeetCode 2419. Longest Subarray With Maximum Bitwise AND is rated Medium on LeetCode.
What is the time complexity of LeetCode 2419. Longest Subarray With Maximum Bitwise AND?: The Python solution on this page runs in O(n), where n is the length of the array \textit{nums}.
What is the space complexity of LeetCode 2419. Longest Subarray With Maximum Bitwise AND?: The Python solution on this page uses O(1) auxiliary space.
What topics does LeetCode 2419. Longest Subarray With Maximum Bitwise AND cover?: LeetCode 2419. Longest Subarray With Maximum Bitwise AND is tagged Bit Manipulation, Brainteaser and Array on LeetCode.