Longest Subarray With Maximum Bitwise AND

Find the maximum bitwise AND achievable by any subarray and return the length of the longest contiguous subarray that attains it. Key observation: the maximum AND equals max(nums), so this reduces to finding the longest run of elements whose bits include all set bits of that maximum.