#2215 - Find the Difference of Two Arrays

Easy • View on LeetCode • View on GitHub

Problem Description

Given two 0-indexed integer arrays nums1 and nums2, return a list answer of size 2 where:

answer[0] is a list of all distinct integers in nums1 which are not present in nums2.
answer[1] is a list of all distinct integers in nums2 which are not present in nums1.

Note that the integers in the lists may be returned in any order.

Solution

/**
 * @param {number[]} nums1
 * @param {number[]} nums2
 * @return {number[][]}
 */
var findDifference = function(nums1, nums2) {
  const set1 = new Set(nums1);
  const set2 = new Set(nums2);
  return [
    [...set1].filter(n => !set2.has(n)),
    [...set2].filter(n => !set1.has(n))
  ];
};