This is a Intern Developer Assistant Python interview question to of implementation of a binary search algorithm to find the first number of teaspoons of sugar that makes a cake too sweet

Problem #0.py

# This code implements a binary search algorithm to find the first number of teaspoons of sugar that makes a cake too sweet

def binary_search(n, isTooSweet):
    # Set left as lower bound, right as upper bound
    left = 1
    right = n
    
 # repeat until right - left <= 1
    while right - left > 1:
        # find average of left and right
            mid = (left + right) // 2
        # check if isTooSweet(mid) is true, then adjust the bonds 
            if isTooSweet(mid):
                 right = mid
        else:
            left = mid
    return right