LeetCode Solution 278. First Bad Version

firstBadVersion.js

const solution = (isBadVersion) => (n) => {
  let left = 1,
    right = n;
  while (left < right) {
    const middle = Math.floor(left + (right - left) / 2);
    if (isBadVersion(middle)) right = middle;
    else left = middle + 1;
  }
  return left;
};

Result
Runtime: 76 ms, faster than 70.43% of JavaScript online submissions for First Bad Version.
Memory Usage: 38.4 MB, less than 53.14% of JavaScript online submissions for First Bad Version.