solution for: Intersection of two arrays

Author: edyluisrey

README.md

@@ -28,4 +28,16 @@ My current statistic
 | [3Sum Closest](https://leetcode.com/problems/3sum-closest/#/description)   | [Java](https://github.com/edyluisrey/Leetcode-Algorithms/blob/master/src/leetcode/TreeSumClosest.java)      | LeetCode Online Judge        |
 | [Sort Characters By Frequency](https://leetcode.com/problems/sort-characters-by-frequency/#/description)   | [Java](https://github.com/edyluisrey/Leetcode-Algorithms/blob/master/src/leetcode/SortCharactersByFrequency.java)      | LeetCode Online Judge        |
 | [Kill Process](https://leetcode.com/problems/kill-process/#/description)   | [Java]()      | LeetCode Online Judge        |
+| [Isomorphic Strings](https://leetcode.com/problems/isomorphic-strings/#/description)   | [Java](https://github.com/edyluisrey/Leetcode-Algorithms/blob/master/src/leetcode/IsomorphicStrings.java)      | LeetCode Online Judge        |
+| [Intersection of Two Arrays]()   | [Java]()      | LeetCode Online Judge        |
+| []()   | [Java]()      | LeetCode Online Judge        |
+| []()   | [Java]()      | LeetCode Online Judge        |
+| []()   | [Java]()      | LeetCode Online Judge        |
+| []()   | [Java]()      | LeetCode Online Judge        |
+| []()   | [Java]()      | LeetCode Online Judge        |
+| []()   | [Java]()      | LeetCode Online Judge        |
+| []()   | [Java]()      | LeetCode Online Judge        |
+| []()   | [Java]()      | LeetCode Online Judge        |
+| []()   | [Java]()      | LeetCode Online Judge        |
+| []()   | [Java]()      | LeetCode Online Judge        |
 | []()   | [Java]()      | LeetCode Online Judge        |

src/leetcode/IntersectionTwoArrays.java

@@ -0,0 +1,37 @@
+package leetcode;
+
+import java.util.Arrays;
+import java.util.HashSet;
+import java.util.Iterator;
+import java.util.Set;
+
+public class IntersectionTwoArrays {
+	
+	public static void  main(String[] args){
+		IntersectionTwoArrays test = new IntersectionTwoArrays();
+		int[] res = test.intersection(new int[]{1}, new int[]{1,1});
+		System.out.println(Arrays.toString(res));
+	}
+	
+	public int[] intersection(int[] nums1, int[] nums2) {
+        Set<Integer> set = new HashSet<Integer>();
+        for(int i =0; i < nums1.length; i++){
+           	set.add(nums1[i]);
+        }
+        Set<Integer> set2 = new HashSet<>();
+        for(int i=0; i<nums2.length; i++){
+        	if(set.contains(nums2[i]))
+        		set2.add(nums2[i]);
+        }
+       int[] res = new int[set2.size()];
+       int k=0;
+       Iterator<Integer> it = set2.iterator();
+       while(it.hasNext()){
+    	   res[k]= it.next();
+    	   k++;
+       }
+       return res;
+    }
+}
+
+