[LeetCode] 2419. Longest Subarray With Maximum Bitwise AND
You are given an integer array nums of size n. Consider a non-empty subarray from nums that has the maximum possible bitwise AND. In other words, let k be the maximum value of the bitwise AND of any s