 32
Avg. time to solve
30 min
Success Rate
70%

Problem Statement

For example

Given:
‘N’ = 5, ‘ARR’ = [1, 2, 3, 4, 5].
The answer will be two since 8 since 8 pairs can be formed and those are  (1,2), (1,5), (2,4), (4,5),(1,2,3), (3,4,5), (1,3,5), (2,3,4). Therefore the final answer is 8.
Input format:
The first line of input contains an integer ‘T’ denoting the number of test cases.

The first line of each test case contains a single integer, ‘N,’ where ‘N’ is the number of elements of the array.

The second line of each test case contains ‘N’ space-separated integers, denoting the array elements.
Output Format :
For each test case, You are supposed to return an integer that denotes the total number of groups that can be formed.
Note:
You are not required to print the expected output; it has already been taken care of. Just implement the function.
Constraints:
1 <= ‘T’ <= 10
1 <= ‘N’ <= 10^4
0 <= ‘ARR[i]’ <= 10 ^ 4

Time Limit: 1sec.

2
5
1 2 3 4 5
3
3 3 3

8
4

Explanation of the Sample Input 1:

In the first test case, The answer will be two since eight since 8 groups can be formed, and those are (1,2), (1,5), (2,4), (4,5),(1,2,3), (3,4,5), (1,3,5), (2,3,4). Therefore the final answer is 8.

In the second test case, The answer will be 4, since 4 groups can be formed, and those are (3,3), (3,3), (3,3), (3,3,3). Therefore the final answer is 4.

2
4
2 4 6 8
5
1 3 5 7 9

Sample Output 2 :

4
7   Console