Problem: First Bad Version

Easy

15 min

Understand how to efficiently locate the first bad version in a product release sequence by applying modified binary search. Learn to minimize calls to the isBadVersion API and practice implementing this pattern for coding interviews.

Statement

You are managing a product development team, and the latest release has failed quality checks. Because each version is built on top of the previous one, once a version is bad, every version after it is also bad.

You are given an array of n versions $[1, 2, …, n]$ , and your task is to determine the first version in this sequence that is bad—the version that causes all later versions to be bad as well.

You have access to an API isBadVersion(version) that returns TRUE if a given version is bad.

Your task is to find the first bad version while minimizing the number of calls to this API.

Constraints:

$1 \leq$ bad $\leq$ n $\leq 10^5$

Problem: First Bad Version

Easy

15 min

Statement

You have access to an API isBadVersion(version) that returns TRUE if a given version is bad.

Your task is to find the first bad version while minimizing the number of calls to this API.

Constraints:

$1 \leq$ bad $\leq$ n $\leq 10^5$

Problem: First Bad Version

Statement

Examples

Understand the problem

Figure it out!

Try it yourself

Problem: First Bad Version

Statement

Examples

Understand the problem

Figure it out!

Try it yourself