<pre class="shiki github-dark shaku"><code>/** * @param {number[]} arr * @return {number[]} */function findTwo(arr) { // your code here arr = arr.sort((a, b) =&gt; a - b); let i = 0, j = arr.length - 1; while(i &lt; j) { let sum = arr[i] + arr[j]; if(sum === 0) { return [i,j]; } else if (sum &gt; 0) { j--; } else { i++; } } return null;}</code></pre>

two pointer technique with O(nlogn)

Given an array of integers, find two number that sums up to 0, return their indices. There might be multiple pairs, any of them would do. If not found…