For this Question: Given an unsorted array A[] of size N of positive integers. One number 'a' from set {1, 2, …N} is missing and one number 'b' occurs twice in an array. The task is to find the repeating and the smallest positive missing number.The first line of input contains an integer T denoting the number of test cases. The description of T test cases follows. 
The first line of each test case contains a single integer N denoting the size of array. 
The second line contains N space-separated integers A(1), A(2), ..., A(N) denoting the elements of the array.

<b>Constraints:</b>
1 &le; T &le; 100
1 &le; N &le; 10^5
1 &le; A[i] &le; NFor each test case, in a new line, print b, which is the repeating number, followed by a, which is the smallest positive missing number, in a single line.Input:
2
2
2 2
3 
1 3 3

Output:
2 1
3 2

<b>Explanation:</b>
Testcase 1: Repeating number is 2 and the smallest positive missing number is 1.
Testcase 2: Repeating number is 3 and the smallest positive missing number is 2., I have written this Solution Code: import java.util.*;
import java.io.*;
import java.lang.*;

class Main
{
    static int a[] = new int[1000001];
    
    public static void main(String args[])
    {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        
        while(t-- > 0)
        {
            int n = sc.nextInt();
            for(int i = 0; i < n; i++)
              a[i]=  sc.nextInt();
              
            for(int i = 0; i < n; i++)
            {
                if(a[Math.abs(a[i])-1]>0)
                  a[Math.abs(a[i])-1] = -a[Math.abs(a[i])-1];
                  else
                    System.out.print(Math.abs(a[i]) + " ");
            }
            
            for(int i = 0; i < n; i++)
            {
                if(a[i] >0)
                  System.out.println(i+1);
            }
        }
    }
    
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?