Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 2419 with 18 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 2419 # by problem number
lcpy gen -s longest_subarray_with_maximum_bitwise_and # by problem name
nums of size n.
Consider a non-empty subarray from nums that has the maximum possible bitwise AND.
k be the maximum value of the bitwise AND of any subarray of nums. Then, only subarrays with a bitwise AND equal to k should be considered.Input: nums = [1,2,3,3,2,2]
Output: 2
Explanation:
The maximum possible bitwise AND of a subarray is 3.
The longest subarray with that value is [3,3], so we return 2.
Input: nums = [1,2,3,4]
Output: 1
Explanation:
The maximum possible bitwise AND of a subarray is 4.
The longest subarray with that value is [4], so we return 1.
class Solution:
# Time: O(n)
# Space: O(1)
def longest_subarray(self, nums: list[int]) -> int:
target = max(nums)
best = 0
run = 0
for num in nums:
run = run + 1 if num == target else 0
if run > best:
best = run
return best
| Time | Space |
|---|---|
| O(n) | O(1) |