Binary Search - LeetCode 704 - JavaScript

Step by step walk through of the solution to the popular Apple coding interview question, Binary Search.

LeetCode 704

JavaScript

0:00 Intro
0:32 Explanation
3:09 Code

#softwareengineering #javascript #leetcode

[valikonen]

you can find midd point a little easy with: let midd = Math.floor((right + left) / 2);

[dragonborn]

I dont understand why you add left to calculate mid. Solution works fine without it, unless I am missing something?