<pre class="shiki github-dark shaku"><code>function getIntersection(arr1, arr2) { let newOne = []; 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; !newOne.includes(arr1[i])) { newOne.push(arr1[i]); } } } return newOne;}console.log(getIntersection( [1, 3, 4, 6], [2, 5, 4, 3]));</code></pre>

Just a simple for loop :)

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 …