Solution: Contiguous Array

Let’s solve the Contiguous Array problem using the Hash Maps pattern.

Statement

You are given a binary array nums containing only 0s0s and 1s1s. Your task is to find the maximum length of a contiguous subarray in which the number of 0s0s and 1s1s is exactly equal.

Return the length of the longest such subarray.

Constraints:

  • 11 \leq nums.length 105\leq 10^5

  • ...

Ask