<pre class="shiki github-dark shaku"><code>/** * @param {any[]} arr1 * @param {any[]} arr2 * @returns {any[]} */function getIntersection(arr1, arr2) { // your code here const map = new Map() for(const num of arr1){ map.set(num,0) } for(const num2 of arr2){ if(map.has(num2)){ map.set(num2,1) } } return Array.from(map).filter(num=&gt;num[1]!=0).map(obj=&gt;obj[0])}</code></pre>

the time complexity is O(n+m) and the space complexity is O(n)

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 …