Intersection of Array

Author: Vishal023

Hashing/InsertionOfArray.java

@@ -0,0 +1,28 @@
+package SummerTrainingGFG.Hashing;
+
+import java.util.HashMap;
+import java.util.HashSet;
+
+/**
+ * @author Vishal Singh */
+public class InsertionOfArray {
+    static int intersectionArray(int[] a,int[] b,int aSize,int bSize){
+        HashSet<Integer> set = new HashSet<>();
+        for (int i = 0; i < aSize; i++) {
+            set.add(a[i]);
+        }
+        int res = 0;
+        for (int i = 0; i < bSize; i++) {
+            if (set.contains(b[i])){
+                res++;
+                set.remove(b[i]);
+            }
+        }
+        return res;
+    }
+    public static void main(String[] args) {
+        int[] a =  {10,15,20,15,30,30,5};
+        int[] b =  {30,5,30,80};
+        System.out.println("Intersection array has - "+intersectionArray(a,b,a.length,b.length)+" elements");
+    }
+}

README.md

@@ -120,6 +120,7 @@ Java Solution for Data Structures and Algorithms.
 * [Hash Map Implementation](Hashing/P_HashMap.java)
 * [Count Distinct Elements](Hashing/CountDistinctElements.java)
 * [Frequency Of Array Elements](Hashing/FrequencyOfArrayElements.java)
+* [Intersection Of Array](Hashing/InsertionOfArray.java)
 
 ### `NOTE: Raise an issue if any program doesn't work.`
 ### `More Topics to be added soon`