LC 349 Intersection Of Two Arrays

Implementation

// 349. Intersection of Two Arrays

// 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.

// Example 1:
// Input: nums1 = [1,2,2,1], nums2 = [2,2]
// Output: [2]

// Example 2:
// Input: nums1 = [4,9,5], nums2 = [9,4,9,8,4]
// Output: [9,4]
// Explanation: [4,9] is also accepted.

// Constraints:
// 1 <= nums1.length, nums2.length <= 1000
// 0 <= nums1[i], nums2[i] <= 1000

var intersection = (nums1, nums2) => {
  const numSet = new Set(nums1);
  const result = new Set();
  for (let n of nums2) {
    if (numSet.has(n)) result.add(n);
  }
  return [...result];
};

console.log(intersection([1, 2, 2, 1], [2, 2]));
console.log(intersection([4, 9, 5], [9, 4, 9, 8, 4]));

export { intersection };

Tests

// Test stub for 03.349.IntersectionOfTwoArrays

describe('03.349.IntersectionOfTwoArrays', () => {
  it('should have a test stub', () => {
    expect(true).toBe(true);
  });
});