Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

You are given an array of unique integers where each element in the array is in the range [1, N]. The array has all distinct elements, and the array’s size is (N - 2). Hence, two numbers from the range are missing from this array. Your task is to return the two missing numbers.

For Example :

```
If ‘N’ = 6
[1, 3, 6, 5]
Then the output will be 2 4.
```

Detailed explanation

Input Format :

```
The first line of input contains an integer T denoting the number of test cases.
The first line of each test case contains 1 integer N, where ‘N’ - 2 is the number of elements of the array.
The second line of each test case contains ‘N’ - 2 space-separated integers, denoting the array elements.
```

Output Format :

```
For each test case, print the two numbers from the range that are missing from this array.
The output of each test case will be printed in a separate line.
```

Note :

```
Print the result in increasing order.
```

Constraints :

```
1 <= T <= 5
1 < N <= 5000
1 <= ARR[i] <= N
Where 'ARR[i]' is the i'th element of the given array.
Time Limit: 1 sec
```

Note :

```
You do not need to print anything. It has already been taken care of. Just implement the given function.
```

```
2
6
1 3 5 6
3
1
```

```
2 4
2 3
```

```
The two elements that are missing in the range [1, 6] are 2 and 4.
The two elements missing in the range [1,3] are 2 and 3.
```

```
2
5
1 3 4
7
2 3 4 5 6
```

```
2 5
1 7
```