Jan 6

Author: siddydutta

2025-01-January-LeetCoding-Challenge/Minimum Number of Operations to Move All Balls to Each Box.py

@@ -0,0 +1,31 @@
+from typing import List
+
+
+class Solution:
+    def minOperations(self, boxes: str) -> List[int]:
+        boxes = list(map(int, boxes))
+        n = len(boxes)
+        left_moves, right_moves = [0] * n, [0] * n
+
+        # compute weighted prefix and suffix sums
+        count = boxes[0]
+        for i in range(1, n):
+            left_moves[i] = left_moves[i - 1] + count
+            count += boxes[i]
+        count = boxes[-1]
+        for i in range(n - 2, -1, -1):
+            right_moves[i] = right_moves[i + 1] + count
+            count += boxes[i]
+        return [l + r for l, r in zip(left_moves, right_moves)]
+
+
+def main():
+    boxes = '110'
+    assert Solution().minOperations(boxes) == [1, 1, 3]
+
+    boxes = '001011'
+    assert Solution().minOperations(boxes) == [11, 8, 5, 4, 3, 4]
+
+
+if __name__ == '__main__':
+    main()

2025-01-January-LeetCoding-Challenge/README.md

@@ -8,7 +8,7 @@
 | January 3  | [2270. Number of Ways to Split Array](https://leetcode.com/problems/number-of-ways-to-split-array/) | Medium | Solved |
 | January 4  | [1930. Unique Length-3 Palindromic Subsequences](https://leetcode.com/problems/unique-length-3-palindromic-subsequences/) | Medium | Solved |
 | January 5  | [2381. Shifting Letters II](https://leetcode.com/problems/shifting-letters-ii/) | Medium | Solved |
-| January 6  | []() |  |  |
+| January 6  | [1769. Minimum Number of Operations to Move All Balls to Each Box](https://leetcode.com/problems/minimum-number-of-operations-to-move-all-balls-to-each-box/) | Medium | Solved |
 | January 7  | []() |  |  |
 | January 8  | []() |  |  |
 | January 9  | []() |  |  |
@@ -40,5 +40,5 @@
 | Level  | Problems | Solved | Unsolved |
 | ---    | --- | --- | --- |
 | Easy   | 1 | 1 | 0 |
-| Medium | 4 | 4 | 0 |
+| Medium | 5 | 5 | 0 |
 | Hard   | 0 | 0 | 0 |