Contiguous Array

IF
AlgoAxiomStaff Engineers
JSTS
Medium20 mins

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

Examples

Example 1:

Input: nums = [0, 1]

Output: 2

Explanation: [0, 1] is the longest contiguous subarray with an equal number of 0 and 1.

Example 2:

Input: nums = [0, 1, 0]

Output: 2

Explanation: [0, 1] or [1, 0] is the longest contiguous subarray with an equal number of 0 and 1.

Example 3:

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

Output: 10

Explanation: The entire array has 5 zeros and 5 ones, so the maximum length is 10.

Constraints

  • 1 <= nums.length <= 10⁵
  • nums[i] is either 0 or 1
Source: Hash Maps pattern — AlgoAxiom
JavaScript
Test Case 1
root = [1, 2, 3]
Test Case 2
root = [1, 2, 3, 4, 5]
Idle