<pre class="shiki github-dark shaku"><code>/** * @param {any[]} arr1 * @param {any[]} arr2 * @returns {any[]} */function getIntersection(arr1, arr2) { // your code here // O(n +m) const sortedArr1 = arr1.sort((a, b) =&gt; a - b); const sortedArr2 = arr2.sort((a, b) =&gt; a - b); const result = []; for (i in sortedArr1) { for (y in sortedArr2) { if(sortedArr1[i] === sortedArr2[y]) { result.push(sortedArr1[i]); } } } return [...new Set(result)];}</code></pre>

array-intersect

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 …