Binary Search

class Solution:
    def guessNumber(self, n: int) -> int:
        """ tc O(lgN)  sc O(1)
        """
        left, right = 1, n+1 
        while left < right:
            mid = left + (right-left)//2
            if guess(mid) == 0 :
                return mid
            elif guess(mid) < 0:
                right = mid -1 
            else:
                left = mid + 1 
        return left