Practice Longest Subarray With Maximum Bitwise AND

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#2419

LeetCode Problem

Longest Subarray With Maximum Bitwise AND

Array Bit Manipulation Brainteaser

Problem Statement

You are given an integer array nums of size n. Consider a non-empty subarray from nums that has the maximum possible bitwise AND. 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.

Source: Longest Subarray With Maximum Bitwise AND on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

nums = [1,2,3,3,2,2]

Output

# Example 2

Input

nums = [1,2,3,4]

Output

Constraints

1 <= nums.length <= 10^5

1 <= nums[i] <= 10^6

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free