Skip to content

Practice Minimum Changes To Make Alternating Binary String

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#1758
LeetCode Problem

Minimum Changes To Make Alternating Binary String

String

Problem Statement

You are given a string s consisting only of the characters '0' and '1'. In one operation, you can change any '0' to '1' or vice versa. The string is called alternating if no two adjacent characters are equal. For example, the string "010" is alternating, while the string "0100" is not. Return the minimum number of operations needed to make s alternating.

Source: Minimum Changes To Make Alternating Binary String on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "0100"
Output
1

# Example 2

Input
s = "10"
Output
0

# Example 3

Input
s = "1111"
Output
2

Constraints

1 <= s.length <= 10^4
s[i] is either '0' or '1'.

Related LeetCode Problems

Practice more problems similar to Minimum Changes To Make Alternating Binary String.

3 Longest Substring Without Repeating Characters Medium5 Longest Palindromic Substring Medium6 Zigzag Conversion Medium8 String to Integer (atoi) Medium10 Regular Expression Matching Hard
← Previous Recyclable and Low Fat ProductsNext → Count Number of Homogenous Substrings

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free