New update is available. Click here to update.

Topics

You are given an array consisting of 0s and 1s. You need to find the length of the largest subarray with an equal number of 0s and 1s.

For example:

```
If the given array is: [0, 0, 1, 0, 1] The largest subarray would be: [0, 1, 0, 1] (last 4 elements) having length 4.
```

Detailed explanation

```
1 ≤ T ≤ 10
1 ≤ N ≤ 10^5
0 ≤ Ai ≤ 1
Time Limit : 1 sec
```

```
2
5
0 0 1 0 1
3
1 0 1
```

```
4
2
```

```
The first test case is already explained in the problem statement.
The second test case, the given array is: [1, 0, 1] The largest subarray would be: [1, 0] or [0,1].
```

```
2
3
1 1 1
5
0 0 0 1 1
```

```
0
4
```