Add solution #350

Author: JoshCrozier

README.md

@@ -21,6 +21,7 @@
 263|[Ugly Number](./0263-ugly-number.js)|Easy|
 264|[Ugly Number II](./0264-ugly-number-ii.js)|Medium|
 345|[Reverse Vowels of a String](./0345-reverse-vowels-of-a-string.js)|Easy|
+350|[Intersection of Two Arrays II](./0350-intersection-of-two-arrays-ii.js)|Easy|
 387|[First Unique Character in a String](./0387-first-unique-character-in-a-string.js)|Easy|
 451|[Sort Characters By Frequency](./0451-sort-characters-by-frequency.js)|Medium|
 459|[Repeated Substring Pattern](./0459-repeated-substring-pattern.js)|Easy|

solutions/0350-intersection-of-two-arrays-ii.js

@@ -0,0 +1,30 @@
+/**
+ * 350. Intersection of Two Arrays II
+ * https://leetcode.com/problems/intersection-of-two-arrays-ii/
+ * Difficulty: Easy
+ *
+ * Given two integer arrays nums1 and nums2, return an array of their intersection.
+ *
+ * Each element in the result must appear as many times as it shows in both arrays
+ * and you may return the result in any order.
+ */
+
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number[]}
+ */
+var intersect = function(nums1, nums2) {
+  const result = [];
+  const map = {};
+
+  nums1.forEach(value => map[value] = (map[value] || 0) + 1);
+  nums2.forEach(value => {
+    if (map[value]) {
+      result.push(value);
+      map[value]--;
+    }
+  });
+
+  return result;
+};