✅✅ Easiest Solution || O(N) time || O(1) space || If-else
How To Solve:-\n- While traversing the string whenver you have a 0, add the current character of white to ans. This means that the more 1s you have seen before 
# How To Solve:-\n- While traversing the string whenver you have a 0, add the current character of white to ans. This means that the more 1s you have seen before a 0, the more steps are added to the answer. When you get a 1, increment white by 1, to count how many 1\'s you got.\n\n# Complexity\n- Time complexity: O ( n )\n\n- Space complexity: O ( 1 )\n\n# Code\n```cpp []\nclass Solution {\npublic:\n    long long minimumSteps(string s) {\n        int count_white=0;\n        long long ans=0;\n        for(auto ch:s){\n            if(ch==\'0\') ans+=count_white;\n            else count_white++;\n        }\n        return ans;\n    }\n};\n```
['Two Pointers', 'String', 'Greedy', 'C++']