<pre class="shiki github-dark shaku"><code>/** * @param {number[]} arr1 - integers * @param {number[]} arr2 - integers * @returns {number[]} */function intersect(arr1, arr2) { // your code here let output = [] for (let i = 0; i &lt; arr1.length; i++) { if (arr2.includes(arr1[i])) { let idx = arr2.findIndex((j) =&gt; j === arr1[i]) arr2.splice(idx, 1) output.push(arr1[i]) } } return output}</code></pre>

O(n)

Given 2 sorted array of integers, find the elements that exist in both arrays. intersect( [1,2,2,3,4,4], [2,2,4,5,5,6,2000]) 1. The arrays might have …