MediumNo. 2419

Longest Subarray With Maximum Bitwise AND — LeetCode 2419 Python Solution

Topics
Bit Manipulation, Brainteaser, Array
Reading time
2 min

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

PythonSolution
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

Time
O(n)where n is the length of the array nums
Space · auxiliary
O(1)

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.

Related problems

Related problems
No.ProblemDifficulty
2425Bitwise XOR of All PairingsMedium
0810Chalkboard XOR GameHard
2568Minimum Impossible ORMedium
2411Smallest Subarrays With Maximum Bitwise ORMedium
0136Single NumberEasy
0137Single Number IIMedium

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.

Stuck on problems like this in a live interview?

Stealth Interview is a desktop app for macOS and Windows. It reads the problem off your screen and returns a working solution with a step-by-step explanation and its time and space complexity, invisible to screen sharing.

Free to download. Check it runs on your machine, then pick a plan.