Minimum Number Of Operations To Move All Balls To Each Box
We can use a prefix sum approach to calculate the minimum number of operations needed to move all balls to each box without simulating each operation. The solution runs in O(n) time and has a space complexity of O(n).
1769. Minimum Number of Operations to Move All Balls to Each Box Difficulty: Medium Topics: Array, String, Prefix Sum You have n boxes. You are given a binary string boxes of length n, where boxes[i] is '0' if the ith box is empty, and '1' if it contains one ball. In one operation, you can move one ball from a box to an adjacent box. Box i is adjacent to box j if abs(i - j) == 1. Note that after doing so, there may be more than one ball in some boxes. Return an array answer of size n, where answer[i] is the minimum number of operations needed to move all the balls to the ith box. Each answer[i...