LIKECS03 | Editorial by aksingh007

Try to think carefully. Answer is simply the number of missing powers of 2.
Code:Java8
```
import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

class Solution{
    public static void main(String[] args) {
        Scanner s=new Scanner(System.in);
        int testcases=s.nextInt();
        while (testcases-->0){
            int n=s.nextInt();
            int k=s.nextInt();
            HashSet<Integer> hashSet=new HashSet<>();
            for(int i=0;i<n;i++){
                int temp=s.nextInt();
                if(!hashSet.contains(temp)){
                    hashSet.add(temp);
                }
            }
            if(hashSet.size()==(1<<k)){
                System.out.println("0");
            }else {
                int pow=(int)Math.pow(2,k),count=0;
                for(int i=1;i<pow;i*=2){
                    if(!hashSet.contains(i)){
                            count++;
                    }
                }
                System.out.println(count);
            }
        }
    }
}
```

LIKECS03 | Editorial by aksingh007

Download submission

All caught up!

View submission

Is your resume even shortlisted?