I was reading an interview experience of AppDynamics and came across this question. Can anyone help me to solve this.\n```\nGiven a string consisting of 0\u2019s and 1\u2019s and we have to find minimum flips to convert string to all 0\u2019s.\nHere if we flip a character then all characters to the right will be flipped as well.\n\nEX: 1000\n\nflip 1 at 0 index then 000 to the right of it will also get flipped resulting 0111\n\nflip 1 at index 1 resulting 0000. So answer is 2 flips.\n```\n**O(N) is expected**

I was reading an interview experience of AppDynamics and came across this question. Can anyone help me to solve this.\n\nGiven a string consisting of 0\u2019s a