Idea from this post:
<a href="https://leetcode.com/discuss/general-discussion/786126/python-powerful-ultimate-binary-search-template-solved-many-problems">https://leetcode.com/discuss/general-discussion/786126/python-powerful-ultimate-binary-search-template-solved-many-problems</a>
<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 left = 0, right = arr.length - 1; while(left &lt; right) { let mid = left + Math.floor((right - left) / 2); if (arr[mid] &gt;= target) { right = mid; } else { left = mid + 1; } } return arr[left] === target ? left: -1;}</code></pre>

Binary search template

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, …