Very Easy C++ solution
Intuition\nEasy self explanatory approach\n Describe your first thoughts on how to solve this problem. \n\n# Approach\nHere in this approch count represents the
# Intuition\n**Easy self explanatory approach**\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\nHere in this approch count represents the count of 1\'s till the current index.\n<!-- Describe your approach to solving the problem. -->\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        long long ans=0;\n        int count=0;\n        for(int i=0;i<s.size();i++){\n            if(s[i]==\'1\'){\n                count++;\n            }\n            else{\n                ans+=count;\n            }\n        }\n        return ans;\n    }\n};\n```
['String', 'Greedy', 'C++']