2026-02-10 10:02:01 +0000 UTC
Longest Balanced Subarray I
Links
Code
import collections
class Solution:
def longestBalanced(self, nums: List[int]) -> int:
count_even, count_odd = 0, 0
res = 0
freqs = collections.defaultdict(int)
for i in range(len(nums)):
num_i = nums[i]
for j in range(i, len(nums)):
num = nums[j]
freqs[num] += 1
if freqs[num] == 1:
if num % 2 == 0:
count_even += 1
else:
count_odd += 1
if count_even == count_odd:
res = max(res, j - i + 1)
freqs.clear()
count_even, count_odd = 0, 0
return res