Intersection of unsorted arrays

Question

Given two arrays, find the intersection(items occur in both arrays)

1. arrays are not sorted, and might have duplicates.
2. you can modify the arrays
3. you can return the items in any order, but without duplicates.

This is an easy problem, What is the time & space complexity of your approach?

Code

/**
 * @param {any[]} arr1
 * @param {any[]} arr2
 * @returns {any[]}
 */
function getIntersection(arr1, arr2) {
  // your code here
}

Source

Source From