Medium
Quiz
#525 Contiguous Array
APPROACH
Given a binary array nums (containing only 0s and 1s), return the length of the longest contiguous subarray that contains an equal count of 0s and 1s.
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.
Example 3:
Input: nums = [0,1,1,1,1,1,0,0,0]
Output: 6
Explanation: [1,1,1,0,0,0] is the longest contiguous subarray with equal number of 0 and 1.
1 of 4
1:00
What is the optimal approach for this problem?