JuniorString
Minimum Changes To Make Alternating Binary String
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.
Example 1
Input
s = "0100"Output
1If you change the last character to '1', s will be "0101", which is alternating.
Example 2
Input
s = "10"Output
0s is already alternating.
Constraints
- 1 <= s.length <= 10^4
- s[i] is either '0' or '1'.
Asked at 6 companies
Practice questions like this out loud in a mock coding interview with a live AI interviewer. First one free.