Minimum Number of Flips to Make the Binary String Alternating - Practice Coding | SlaveCode
0
0123456789
0
0123456789
:
0
0123456789
0
0123456789
1888. Minimum Number of Flips to Make the Binary String Alternating
Medium
30 Points
String
Dynamic Programming
Sliding Window
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.
Examples
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 <= 105
s[i] is either '0' or '1'.
1888. Minimum Number of Flips to Make the Binary String Alternating
Medium
30 Points
String
Dynamic Programming
Sliding Window
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.
Examples
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".