Minimum Swaps to Group Circular Ones
Amazonâ—Ź MediumINTERNONSITE INTERVIEWProblem statement
Given a circular binary array nums, return the minimum number of swaps needed to place all its 1 values in one consecutive circular block.
The problem statement continues
ProExamples
Example 1
nums = [0,1,0,1,1,0,0]return = 1There are three ones. Positions 1, 2, 3 contain [1,0,1]. Swapping the zero at position 2 with the one at position 4 groups all three ones in one swap.
FastPrep Pro
Reported in 1 Amazon interview this weekUnlock this recently reported problem
FastPrep Pro gives you full access to interview problems reported within the last week.
- Full problem statement and constraints
- 1 more worked example, explained
- Guided hints and editorial
- Run your code on real test cases
$8.25/month
$99 billed yearly — or $19 month-to-month. Cancel anytime.
Free plan — 2 of 2 free unlocks used this week