Divide Chocolate Python Solution with Tests

lcpy gen -n 1231   # by problem number
lcpy gen -s divide_chocolate   # by problem name

Input: sweetness = [1,2,3,4,5,6,7,8,9], k = 5
Output: 6
Explanation: You can divide the chocolate to [1,2,3], [4,5], [6], [7], [8], [9]

Input: sweetness = [5,6,7,8,9,1,2,3,4], k = 8
Output: 1
Explanation: There is only one way to cut the bar into 9 pieces.

Input: sweetness = [1,2,2,1,2,2,1,2,2], k = 2
Output: 5
Explanation: You can divide the chocolate to [1,2,2], [1,2,2], [1,2,2]

class Solution:
    # Time: O(n * log(sum(sweetness)))
    # Space: O(1)
    def maximize_sweetness(self, sweetness: list[int], k: int) -> int:
        def can_eat(target: int) -> bool:
            current = pieces = 0
            for sweet in sweetness:
                current += sweet
                if current >= target:
                    current = 0
                    pieces += 1
            return pieces > k

        low, high = 0, sum(sweetness)
        while low < high:
            mid = (low + high + 1) // 2
            if can_eat(mid):
                low = mid
            else:
                high = mid - 1
        return low