<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 set = [] let map = {} for (let value of arr1) { if (map[value]) { map[value] += 1 } else { map[value] = 1 } } for (let value of arr2) { if (map[value]) { set.push(value) map[value] -= 1 } } return set}console.log(intersect( [1,2,2,3,4,4], [2,2,4, 4, 4,5,5,6,2000]))</code></pre>

This is my accepted solution

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 …