Subarray with Equal Occurrences Problem Statement

Given an array ARR consisting of 0s and 1s only, your task is to determine the number of non-empty subarrays where the number of 0s and 1s are equal.

Input:

The first line contains an integer 'T' representing the number of test cases. Each test case contains: - The first line with a positive integer 'N', the length of the array/list. - The second line with 'N' space-separated integers, each being either 0 or 1, representing the array/list.

Output:

For each test case, output the count of subarrays where the number of 0s and 1s are equal. Each test case's result should be printed on a new line.

Example:

Input:

2
6
0 1 0 1 0 1
4
1 0 1 0

Output:

9
4

Constraints:

• 1 <= T <= 100
• 1 <= N <= 5 * 10³
• 0 <= ARR[i] <= 1

Note the time limit is 1 second.