Problem of the day
The first line of input contains a single integer T, representing the number of test cases or queries to be run.
Then the T test cases follow.
The first line of each test case contains a positive integer N which represents the length of the array.
The second line of each test case contains N integers representing the elements of the array 'ARR'.
For each test case, print a single integer denoting the minimum positive integer that is missing from the given input array.
Th output of each test case will be printed in a separate line.
You do not need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 10
1 <= N <= 10^5
-10^5 <= ARR[i] <= 10^5
Time Limit: 1 sec
1
5
3 2 -6 1 0
4
The first positive number is 1 and it is present in the array similarly 2 and 3 are also present in the array. 4 is missing from the array. Thus, the minimum positive integer that is missing is 4.
1
5
0 1 2 3 4
5