 Two numbers with odd occurrences
##### Submissions: 1781   Accuracy: 41.31%   Difficulty: Easy   Marks: 2

Given an unsorted array arr[] of size N and that contains even number of occurrences for all numbers except two numbers. Find the two numbers in decreasing order which have odd occurrences.

Note: Expected O(n) time complexity and O(1) extra space.

Input:
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each test case contains an integer N denoting the size of the array. Then the following line contains n space separated integers.

Output:
Print two space separated integers which have odd occurrences. Print the greater number first and then the smaller odd number.

Constraints:
1 <= T <= 100
2 <= N <= 105
1 <= arr[i] <= 105

Example:
Input:
2
8
4 2 4 5 2 3 3 1
6
1 7 5 5 4 4

Output:
5 1
7 1

Explanation:
Testcase 1: 5 and 1 are odd occurring elements in the array.
Testcase 2: 7 and 1 are odd occurring elements in the array.

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

Contributor: Ayush Govil
Author: Ayush Govil 1

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.