Day 13 - Contiguous Array

Solution.py

class Solution:
    def findMaxLength(self, nums: List[int]) -> int:
        history = {0: -1}
        balance = 0
        res = 0
        
        for i in range(len(nums)):
            balance += 1 if nums[i] else -1
            
            if balance in history:
                res = max(res, i - history[balance])
            else:
                history[balance] = i
            
        return res