Balanced Subarray
Easy
Given an array consisting of only 0s and 1s, find the length of the largest contiguous subarray that has an equal number of 0s and 1s.
Example 1
Input
[ 0, 1 ]
Output
2
Explanation. The only subarray with equal number of 0s and 1s is the entire array.
Example 2
Input
[ 0, 1, 0 ]
Output
2
Explanation. The subarray [0, 1] or [1, 0] has an equal number of 0s and 1s.
Example 3
Input
[ 0, 1, 0, 1 ]
Output
4
Explanation. The entire array has equal number of 0s and 1s.
Example 4
Input
[ 0, 0, 1, 1, 0 ]
Output
4
Explanation. The subarray [0, 1, 1, 0] has an equal number of 0s and 1s.
Example 5
Input
[ 1, 1, 1, 1 ]
Output
0
Explanation. There is no subarray with equal number of 0s and 1s.
Follow-up: How would your solution change if the input could contain any integers, not just 0s and 1s?
Constraints:
The input array will contain at least one element and a maximum of 10,000 elements. All array elements will be either 0 or 1.
- Views
- 13