Given an array A of size N. The contents of A are copied into another array B and numbers are shuffled. Also, one element is removed from B. The task is to find the missing element.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. Each testcase contains three lines of input. The first line contains an integer N, where N is the size of array. The second line contains N space separated integers denoting elements of the array A[ ]. The third line contains N-1 space separated integers denoting elements of the array B[ ].
For each testcase, print the missing number.
1 <= T <= 1000
1 <= N <= 107
1 <= A, B <= 1010
1 3 5 6 9
1 9 6 5
1 2 3
Testcase1: 3 is the only element missing from B.
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.