Minimum Number of Operations to Move All

lcpy gen -n 1769   # by problem number
lcpy gen -s minimum_number_of_operations_to_move_all_balls_to_each_box   # by problem name

Input: boxes = "110"
Output: [1,1,3]
Explanation: The answer for each box is as follows:
1) First box: you will have to move one ball from the second box to the first box in one operation.
2) Second box: you will have to move one ball from the first box to the second box in one operation.
3) Third box: you will have to move one ball from the first box to the third box in two operations, and move one ball from the second box to the third box in one operation.

Input: boxes = "001011"
Output: [11,8,5,4,3,4]

class Solution:
    # Time: O(n)
    # Space: O(1) extra (output excluded)
    def min_operations(self, boxes: str) -> list[int]:
        n = len(boxes)
        answer = [0] * n

        balls = 0
        ops = 0
        for i in range(n):
            answer[i] += ops
            if boxes[i] == "1":
                balls += 1
            ops += balls

        balls = 0
        ops = 0
        for i in range(n - 1, -1, -1):
            answer[i] += ops
            if boxes[i] == "1":
                balls += 1
            ops += balls

        return answer