Tutorials  Articles  Notifications  Login  Signup


Finding the numbers

Problem statement
You are given an array A containing 2*N+2 positive numbers, out of which 2*N numbers exist in pairs whereas the other two number occur exactly once and are distinct. You need to find the other two numbers and print them in ascending order.

Input format
The first line contains a value T, which denotes the number of test cases. Then T test cases follow .The first line of each test case contains a value N. The next line contains 2*N+2 space separated integers.

Output format
Print in a new line the two numbers in ascending order.

Constraints
1<=T<=100 1<=N<=10^6 1<=A[i]<=5*10^8

Sample Input 1
2
2
1 2 3 2 1 4
1
2 1 3 2


Sample output 1
3 4
1 3



Explanation
N/A





// Write your code here in C++


Editiorial

N/A



go back Go back to Google



Author: Rajan Shah

Level: Medium

Uploaded on: Aug. 15, 2020

Lab: Google

Section: None


Found something wrong ? Inform us



Other problems from this lab

Small Factorials

ETF - Euler Totient Function

Subarray with given sum

Maximum Index