|All-time Popular Problems|
|Delete without head pointer|
|Rotate Array by n elements|
|Reverse array in groups|
|Implement Queue using Linked List|
|Column name from a given column number|
|Element with left side smaller and right side greater|
|Remove duplicate element from sorted Linked List|
|Triplet Sum in Array|
|Reverse an Array|
You are given an array of N+2 integer elements. All elements of the array are in range 1 to N. And all elements occur once except two numbers which occur twice. Find the two repeating numbers.
The first line of the input contains an integer T, denoting the total number of test cases. Then T test cases follow Each test case consists of two lines. First line of each test case contains an integer N denoting the range of numbers to be inserted in array of size N+2. Second line of each test case contains the N+2 space separated integers denoting the array elements.
Print the two elements occuring twice in the array. Order of the two elements must be preserved as in the original list, i.e., print the element which arrives first(2nd time).
1 ≤ T ≤ 30
1 ≤ N ≤ 100
1 2 1 3 4 3