Longest Subarray Max AND

You are given an integer array nums. Let M be the maximum possible bitwise AND of any subarray — which is always the maximum element in the array, since ANDing with smaller values can only reduce the result. Return the length of the longest consecutive subarray whose bitwise AND equals M.

Examples
Input: [1,2,3,3,2,2]
Output: 2
Hints

Longest Subarray Max AND

You are given an integer array nums. Let M be the maximum possible bitwise AND of any subarray — which is always the maximum element in the array, since ANDing with smaller values can only reduce the result. Return the length of the longest consecutive subarray whose bitwise AND equals M.