Simple Python Solution
\nclass Solution:\n    def minOperations(self, boxes: str) -> List[int]:\n        \n        l=[]\n        \n        for i in range(len(boxes)):\n            k=0
```\nclass Solution:\n    def minOperations(self, boxes: str) -> List[int]:\n        \n        l=[]\n        \n        for i in range(len(boxes)):\n            k=0\n            for j in range(len(boxes)):\n                if boxes[j]==\'1\':\n                    k+=abs(i-j)\n            l.append(k)\n            \n        return l\n```
['Python', 'Python3']