<pre class="shiki github-dark shaku"><code>/** * @param {number[]} arr1 - integers * @param {number[]} arr2 - integers * @returns {number[]} */function intersect(arr1, arr2) { if (!arr1.length || !arr2.length) return [] let counter1 = 0; let counter2 = 0; const intersectionValues = []; while(counter1 &lt; arr1.length) { if(arr1[counter1] !== arr2[counter2]) { if(counter2 &lt; arr2.length-1) { counter2++; }else { counter1++ counter2=0; } } if(arr1[counter1] === arr2[counter2]) { intersectionValues.push(arr1[counter1]) counter1++ counter2++ } } return intersectionValues}</code></pre>

loop for and while

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 …