<pre class="shiki github-dark shaku"><code>function intersect(arr1, arr2) { let result = []; let used = []; for (let i = 0; i &lt; arr1.length; i++) { for (let j = 0; j &lt; arr2.length; j++) { if (arr1[i] === arr2[j] &amp;&amp; !used[j]) { result.push(arr1[i]); used[j] = true; break; } } } return result;}console.log( intersect( [1, 2, 2, 3, 4, 4], [2, 2, 4, 5, 5, 6, 2000] )); // [2, 2, 4]</code></pre>

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 …