Longest Subarray With Maximum Bitwise AND

Statement

Given an integer list, nums, find the length of the longest subarrayA subarray is a contiguous sequence of elements within the array. where the bitwise AND of its elements equals the maximum possible bitwise AND among all subarrays of nums. The bitwise AND of a list is calculated by performing the bitwise AND operation on all elements within the subarray.

Constraints:

• $1\leq$ nums.length $\leq 10^3$

• $1\leq$ nums[i] $\leq10^4$

Examples