Very very easy and simple c++ solution
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# Co
# 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```cpp []\nclass Solution {\npublic:\n    long long minimumSteps(string s) {\n        long long cnt=0, ans=0;\n        for(int i=s.size()-1;i>=0;i--){\n            if(s[i]==\'0\') cnt++;\n            else ans+=cnt;\n        }\n        return ans;\n    }\n};\n```
['C++']