Skip to content

Practice Minimum Number of Swaps to Make the Binary String Alternating

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

Medium#1864
LeetCode Problem

Minimum Number of Swaps to Make the Binary String Alternating

Problem Statement

Given a binary string s, return the minimum number of character swaps to make it alternating, or -1 if it is impossible. The string is called alternating if no two adjacent characters are equal. For example, the strings "010" and "1010" are alternating, while the string "0100" is not. Any two characters may be swapped, even if they are not adjacent.

Source: Minimum Number of Swaps to Make the Binary String Alternating on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
s = "111000"
Output
1

# Example 2

Input
s = "010"
Output
0

# Example 3

Input
s = "1110"
Output
-1

Constraints

1 <= s.length <= 1000
s[i] is either '0' or '1'.

Related LeetCode Problems

Practice more problems similar to Minimum Number of Swaps to Make the Binary String Alternating.

Review your practice with PhantomCodeAI

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