Solve Beautiful Binary String using C#
Solve Beautiful Binary String using C#
Alice has a binary string. She thinks a binary string is beautiful if and only if it doesn't contain the substring "010" .
In one step, Alice can change a 1 to a 0 or vice versa. Count and print the minimum number of steps needed to make Alice see the string as beautiful.
For example, if Alice's string b="010" is she can change any one element and have a beautiful string.
If you want to solve this type of problem next time own their own then please watch this video till the end, you may solve this problem just copying the code but copying code is not perfect solution.
After watching this video if you still facing any challenges or issue please feel free to write to us on [email protected] or in comment section
We love to hear your query and we will back to you as soon as possible.
Happy Learning
Codes Evidence