Minimum Number of Flips to Make the Binary String Alternating
You are given a binary string s.
You are given a binary string s. You are allowed to perform two types of operations on the string in any sequence:
Return the minimum number of type-2 operations you need to perform such that s becomes alternating.
The string is called alternating if no two adjacent characters are equal.
Example 1
Input: s = "111000"
Output: 2
Explanation: Use the first operation two times to make s = "100011". Then, use the second operation on the third and sixth elements to make s = "101010".
Example 2
Input: s = "010"
Output: 0
Explanation: The string is already alternating.
Example 3
Input: s = "1110"
Output: 1
Explanation: Use the second operation on the second element to make s = "1010".
Constraints
- 1 <= s.length <= 10^5
- s[i] is either '0' or '1'.
Hints
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.