BETA

Difficulty Level:

Easy

Total Submissions: 130 Accuracy:

49.23%

Sub-arrays with equal number of occurences
       

Given an array and two integers say, x and y, find the number of sub-arrays in which the number of occurrences of x is equal to number of occurrences of y.

Input : arr[] = {1, 2, 1},
        x = 1, y = 2 
Output : 2
The possible sub-arrays have same equal number 
of occurrences of x and y are:
1) {1, 2}, x and y have same occurrence(1).
2) {2, 1}, x and y have same occurrence(1).

Input:
The first line consists of an integer T i.e number of test cases. The first line of each test case consists of three integers N,x and y.The next line consists of N spaced integers. 

Output:
Print the count of total number of sub-arrays satisfying specified condition.

Constraints: 
1<=T<=100
1<=N,a[i],x,y<=100

Example:
Input:

2
3 1 2
1 2 1
3 4 6
1 2 1 

Output:
2
6

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Saksham Ashtputre

Set Default Code

					   
It is recommended to 'Compile & Test' your code before clicking 'Submit'!

Compilation/Execution Result:

Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.