278 First Bad Version - Easy

Problem:

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.

Example 1:

Input: n = 5, bad = 4 Output: 4 Explanation: call isBadVersion(3) -> false call isBadVersion(5) -> true call isBadVersion(4) -> true Then 4 is the first bad version.

Example 2:

Input: n = 1, bad = 1 Output: 1

Constraints:

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

Problem Analysis:

• perform binary search
• Time Complexity: O(LogN)
• Space Complexity: O(1)

Solutions:

# The isBadVersion API is already defined for you.
# def isBadVersion(version: int) -> bool:

class Solution:
    def firstBadVersion(self, n: int) -> int:
        l, r = 1, n

        while l <= r:
            m = (l + r) // 2
            res = isBadVersion(m)

            if res:
                r = m - 1
            else:
                l = m + 1
        return l

Similar Questions

• 35-search-insert-position35 Search Insert Position - EasyProblem: Given a sorted array of distinct integers and a target value, return the index if the target is found. If not, return the index where it would be if it were inserted in order. You must write an algorithm with O(log n) runtime complexity. Example 1: Input: nums = \[1,3,5,6\], target = 5 Output: 2 Example 2: Input: nums = \[1,3,5,6\], target = 2 Output: 1 Example 3: Input: nums = \[1,3,5,6\], target = 7 Output: 4 Constraints: * `1 int: l, r = 0, len(nums) -1 wh
• 374-guess-number-higher-or-lower374 Guess Number Higher or Lower - EasyProblem: We are playing the Guess Game. The game is as follows: I pick a number from 1 to n. You have to guess which number I picked. Every time you guess wrong, I will tell you whether the number I picked is higher or lower than your guess. You call a pre-defined API int guess(int num), which returns three possible results: * -1: Your guess is higher than the number I picked (i.e. num > pick). * 1: Your guess is lower than the number I picked (i.e. `num int: class Solution: def gues