Easy solve..........🔥🔥🔥🔥
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```c []\nint64_t minimumSteps(const char * const str){\n\tint64_t cnt = 0;\n\n\tint oneCnt = 0;\n\tfor (int i = 0; str[i] != \'\\0\'; i += 1){\n\t\tswitch (str[i]){\n\t\tcase \'0\':\n\t\t\tcnt += oneCnt;\n\t\t\tbreak;\n\t\tcase \'1\':\n\t\t\toneCnt += 1;\n\t\t\tbreak;\n\t\tdefault:\n\t\t\tassert(0);\n\t\t}\n\t}\n\n\treturn cnt;\n}\n```
['Two Pointers', 'String', 'Greedy', 'C']