easy || just 3 line of code 😍❤️‍🔥
if it\'s help, please up \u2B06 vote! \u2764\uFE0F\n\n\n# Complexity\n- Time complexity: o(N)\n Add your time complexity here, e.g. O(n) \n\n- Space complexity:
# if it\'s help, please up \u2B06 vote! \u2764\uFE0F\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```\nclass Solution {\npublic:\n    long long minimumSteps(string s) \n    {\n        long long ans = 0, one = 0;\n        for(char ch:s)\n            ch==\'1\' ? one++ : ans += one;\n        return ans;\n    }\n};\n```
['Two Pointers', 'String', 'Greedy', 'C++']