# Leet Code 278: First Bad Version

### Problem statement:

You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad.

Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be bad.

You are given an API bool isBadVersion(version) which returns whether version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API.

### Constraints:

• 1 <= bad <= n <= 231 - 1

### Solution:

```.css-1r5hp7i{position:absolute;top:0;right:0;z-index:1;border-radius:0 5px 0 5px;padding:0.25rem 0.6rem;border:none;cursor:pointer;background:#44475a;color:rgb(248, 248, 242);-webkit-transition:all 200ms ease;transition:all 200ms ease;font-size:12px;}.css-1r5hp7i:disabled{cursor:not-allowed;}.css-1r5hp7i:not(:disabled):hover,.css-1r5hp7i:not(:disabled):focus{background:#8257E6;}```/** * Definition for isBadVersion() *  * @param {integer} version number * @return {boolean} whether the version is bad * isBadVersion = function(version) { *     ... * }; */
/** * @param {function} isBadVersion() * @return {function} */var solution = function(isBadVersion) {    /**     * @param {integer} n Total versions     * @return {integer} The first bad version     */    return function(n) {                let start = 1;        let end = n;                while (start <= end) {            const mid = Math.floor((start+end)/2);            if (isBadVersion(mid)) {                end = mid-1;            } else {                start = mid+1;            }        }                return start;    };};``````