How should I practice Minimum Swaps to Group Circular Ones?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Motive onsite interview problems in FastPrep.

Is Minimum Swaps to Group Circular Ones associated with Motive?

FastPrep tags this as a Motive onsite interview coding practice problem when the problem catalog has that company and stage context.

Minimum Swaps to Group Circular Ones

Motive● MediumFULLTIMEONSITE INTERVIEW

Learn

Problem statement

Given a circular binary array nums, return the minimum number of swaps between any two positions needed to group all 1s into one contiguous circular block.

Function

minSwapsCircularOnes(nums: int[]) → int

Examples

Example 1

nums = [0,1,0,1,1,0,0]return = 1

Example 2

nums = [1,1,0,0,1]return = 0

Constraints

1 <= nums.length <= 100000.
Every value is 0 or 1.