Super Easy Python Solution
\n\n# Complexity\n- Time complexity:O(n)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:O(1)\n Add your space complexity here, e.g. O(n) \n\n
\n\n# Complexity\n- Time complexity:O(n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python3 []\nclass Solution:\n    def minimumSteps(self, s: str) -> int:\n        \n        # Take the zero count\n        zero_count = 0\n        moves = 0\n\n        # Traverse from right to left\n        # Check for zeroes on the right\n        # The number of zeroes on right is the number of moves required\n        for i in range(len(s)-1,-1,-1):\n            if s[i] == "0":\n                zero_count += 1\n            else:\n                moves += zero_count\n\n        return moves\n        \n```
['String', 'Greedy', 'Python3']