LC 0278 [E] First Bad Version - ALawliet/algorithms GitHub Wiki

binary search leftmost


class Solution:
    def firstBadVersion(self, n):
        l = 0
        r = n
        while l < r:
            m = (l + r) // 2
            if not isBadVersion(m):
                l = m + 1
            else:
                r = m
        return l