#349 - Intersection of Two Arrays

Easy • View on LeetCode • View on GitHub

Array Hash Table Sorting Binary Search Two Pointers

Problem Description

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.

Solution

/**
 * @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));
};