How should I practice Minimum Swaps To Binary Palindrome?

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

Is Minimum Swaps To Binary Palindrome associated with Rubrik?

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

Problem

Minimum Swaps To Binary Palindrome

Learn this problem

RubrikOA

Problem statement

Given a binary string s consisting only of '0' and '1', return the minimum number of swaps required to rearrange s into a palindrome.

In one swap, you may swap any two characters in the string; the swapped characters do not need to be adjacent. If it is impossible to make s a palindrome, return -1.

Function

minSwapsToPalindrome(s: String) → int

Examples

Example 1

s = "101000"return = 1

Swap the '1' at index 2 with the '0' at index 5 to obtain "100001", which is a palindrome.

Constraints

The source post did not specify numeric constraints.

Problem statement

Function

Examples

Example 1

Constraints

More Rubrik problems