Given an array of integers, every element appears twice except for one. Find that single one in linear time complexity and without using extra memory.
The first line of input consists number of the test cases. The description of T test cases is as follows:
The first line of each test case contains the size of the array, and the second line has the elements of the array.
In each separate line print the number that appears only once in the array.
1 ≤ T ≤ 70
1 ≤ N ≤ 100
0 ≤ A[i] ≤ 100000
1 2 4 3 3 2 5 6 1 6 5
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.