def firstBadVersion(self, n):
        left, right = 1, n
        while left <= right:
            mid = left + (right - left) / 2
            if isBadVersion(mid):
                right = mid - 1
            else:
                left = mid + 1
        return left
Take items from the watch queue then process them
dataset/ETHPy150Open kamyu104/LeetCode/Python/first-bad-version.py/Solution.firstBadVersion--crossover with--dataset/ETHPy150Open walkr/hn/hn/workers.py/NotifyWorker.run