<pre class="shiki github-dark shaku"><code>/** * @param {number[]} arr - ascending unique array * @param {number} target * @return {number} */function binarySearch(arr, target){ // your code here let l = 0, r = arr.length - 1; while(l &lt;= r) { let mid = (r - l) &gt;&gt; 1 + l if(arr[mid] === target) return mid if(arr[mid] &lt; target) l = mid + 1 else r = mid - 1 } return -1}</code></pre>

This is my answer

Even in Front-End review, basic algorithm technique like Binary Search are likely to be asked. You are given an unique & ascending array of integers, …