13September2024 - 2419. Longest Subarray With Maximum Bitwise AND.py

class Solution:
    def longestSubarray(self, nums: List[int]) -> int:
        max_val = max(nums)
        
        longest = 0
        current_length = 0
        
        for num in nums:
            if num == max_val:
                current_length += 1
                longest = max(longest, current_length)
            else:
                current_length = 0
        return longest
    
# Time complexity: O(n)