In First But Second Java

PROGRAM TO FIND ELEMENTS WHICH ARE PRESENT IN FIRST ARRAY AND NOT IN SECOND



import java.util.HashSet;
import java.util.Set;
  
public class MAIN{
  
    // Function for finding elements which  
    // are there in a[] but not in b[]. 
    static void findMissing(int a[], int b[],  
                     int n, int m) 
    
        // Store all elements of  
        // second array in a hash table 
        HashSet<Integer> s = new HashSet<>(); 
        for (int i = 0; i < m; i++) 
            s.add(b[i]); 
        
        // Print all elements of first array 
        // that are not present in hash table 
        for (int i = 0; i < n; i++) 
            if (!s.contains(a[i]))
                System.out.print(a[i] + " "); 
    
  
     public static void main(String []args){
          
        int a[] = { 1, 2, 6, 3, 4, 5 }; 
        int b[] = { 2, 4, 3, 1, 0 }; 
        int n = a.length; 
        int m = b.length; 
        findMissing(a, b, n, m);
     }
}


OUTPUT
6 5

Comments

Popular posts from this blog

Solve the Sudoku Python

Solve the Sudoku Java

Find Duplicates Java