How should I practice Minimum Operations to Make Alternating Binary String?

Start by reading the full statement, solve the visible examples, then compare the pattern against related IBM online assessment problems in FastPrep.

Is Minimum Operations to Make Alternating Binary String associated with IBM?

FastPrep tags this as a IBM online assessment coding practice problem when the problem catalog has that company and stage context.

Problem · String

Minimum Operations to Make Alternating Binary String

Learn this problem

● Easy

IBMINTERNOA

See IBM hiring insights

Problem statement

You are given a binary string. Transform it into an alternating binary string using the following operation: select any bit and flip it (change 0 to 1 or 1 to 0).

Find the minimum number of operations required to make the string alternating.

Function

solveBinaryString(s: String) → int

Examples

Example 1

s = "11101"return = 1

Flipping the bit at index 1 (0-based indexing) makes the string "10101", which is alternating. So the minimum operations is 1.

Example 2

s = "111101"return = 2

Flip the 1st and 3rd characters (1-based indexing) to obtain "101010", which is alternating. Thus, the minimum operations is 2.

Constraints

0 ≤ length of s ≤ 2 * 10^5
s consists only of characters '0' and '1'