Skip to main content
Back to problems
#278
Easy Algorithms

First bad version

Binary Search Interactive
46.9% acceptance
Jan 12, 2026
8997
3435
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.

Solution

Rust
Time O(n log n)
Space O(1)
LeetCode
solution.rs
impl Solution {
  pub fn first_bad_version(&self, n: i32) -> i32 {
    let mut left = 1;
    let mut right = n;
    
    while left < right {
      let mid = left + (right - left) / 2;
      if self.is_bad_version(mid) {
        right = mid;
      } else {
        left = mid + 1;
      }
    }
    
    left
  }
}