Search⌘ K

Minimum Flips to Make the Binary String Alternate

Try to solve the Minimum Flips to Make the Binary String Alternate problem.

Statement

Given a binary string s, the following two operations can be performed in any sequence:

  • Type–1: Remove the character at the start of the string s and append it to the end of the string.

  • Type–2: Pick any character from the string and flip its value. in other words, if its value is 00, it becomes 1 ...