Contiguous Array

Medium

Topics
ArrayHash TablePrefix Sum

Given a binary array nums, return the maximum length of a contiguous subarray with an equal number of 0s and 1s.

Example 1

Input:  nums = [0,1]
Output: 2
Explanation: [0,1] is the longest subarray with equal counts.

Example 2

Input:  nums = [0,1,0]
Output: 2

Example 3

Input:  nums = [0,0,1,0,0,0,1,1]
Output: 6

Constraints

  • 1 <= nums.length <= 10^5
  • nums[i] is either 0 or 1
Run ⌘' · Submit ⌘⏎