Longest equal zero-one subarray
Given a binary array nums containing only 0s and 1s, return the length of the longest contiguous subarray that contains an equal number of 0s and 1s. If no such subarray exists, return 0. Here 1 <= len(nums) <= 10^5.
Implement
find_max_length(nums: list[int]) → intExamples
in
[[0,1,0]]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 20 min
solution.py
InputExpectedGot
[[0,1,0]]2not run yetsample