**Minimum Difference**\n\nGiven a string of \'b\'s and \'w\'s. We can take as many characters as we want from the start and can append it in end of string, but sequence of characters should remain same. What can be minimum number of characters we need to flip(\'b\' to \'w\' or \'w\' to \'b\') in order to make string an alternate sequence of \'b\'s and \'w\'s , i.e. "bwbwbwbwb" or "wbwbw" ...  \n\nTestCases :\n* "wwb" - 0\n* "bwwwbbbbb" - 3\n* "wwwwwbbww" - 3\n* "bbwbww" - 2\n* "bww" - 0\n* "wbbww" - 1 \n\nI don\'t remember other test cases. If anyone have detailed question please share. Feel free to share your approaches.

Minimum Difference\n\nGiven a string of \'b\'s and \'w\'s. We can take as many characters as we want from the start and can append it in end of string, but sequ