Watch 10 video solutions for Contiguous Array, a medium level problem involving Array, Hash Table, Prefix Sum. This walkthrough by Ashish Pratap Singh has 1,002,131 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
Given a binary array nums, return the maximum length of a contiguous subarray with an equal number of 0 and 1.
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 a longest contiguous subarray with equal number of 0 and 1.
Constraints:
1 <= nums.length <= 105nums[i] is either 0 or 1.