Leetcode 1864. Minimum Number of Swaps to Make the Binary String Alternating

Determine whether the counts of 0s and 1s allow an alternating arrangement (they can differ by at most 1), and if so compute the minimum swaps by comparing s to the two possible alternating targets ("0101..." and "1010...") and taking the smaller mismatch-based swap count; return -1 if impossible.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1864. Minimum Number of Swaps to Make the Binary String Alternating

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact