Add solution #349

Author: JoshCrozier

README.md

@@ -29,6 +29,7 @@
 264|[Ugly Number II](./0264-ugly-number-ii.js)|Medium|
 283|[Move Zeroes](./0283-move-zeroes.js)|Easy|
 345|[Reverse Vowels of a String](./0345-reverse-vowels-of-a-string.js)|Easy|
+349|[Intersection of Two Arrays](./0349-intersection-of-two-arrays.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|

solutions/0349-intersection-of-two-arrays.js

@@ -0,0 +1,19 @@
+/**
+ * 349. Intersection of Two Arrays
+ * https://leetcode.com/problems/intersection-of-two-arrays/
+ * Difficulty: Easy
+ *
+ * Given two integer arrays `nums1` and `nums2`, return an array of their intersection.
+ *
+ * Each element in the result must be unique and you may return the result in any order.
+ */
+
+/**
+ * @param {number[]} nums1
+ * @param {number[]} nums2
+ * @return {number[]}
+ */
+var intersection = function(nums1, nums2) {
+  const set = new Set(nums1);
+  return nums2.filter(value => set.delete(value));
+};