Problem of the day
The first line of the input contains ‘T’ denoting the number of test cases.
The first line of each test case contains an integer ‘N’, representing the length of the array.
The second line of each test case contains N space-separated integers of the array A.
For each test case, print the only integer which occurs once in the array.
The output of each test case is printed on a new line.
You do not need to print anything, it has already been taken care of. Just implement the given function.
1 <= T <= 50
1 <= N <= 10^4
-10^6 <= A[i] <=10^6
Where T denotes the number of test cases and N denotes the length of array A[].
Time Limit: 1 sec
2
7
7 3 5 4 5 3 4
9
5 6 9 6 1 9 1 5 3
7
3
In the first test case the integers 3, 4, 5 occur twice and only the integer 7 occurs once.
In the second test case the integers 1, 5, 6, 9 occur twice and only the integer 3 occurs once.
3
1
5
3
6 9 6
5
6 9 3 6 3
5
9
9