Skip to content

Practice Minimum Swaps to Group All 1's Together II

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

Medium#2134
LeetCode Problem

Minimum Swaps to Group All 1's Together II

Problem Statement

A swap is defined as taking two distinct positions in an array and swapping the values in them. A circular array is defined as an array where we consider the first element and the last element to be adjacent. Given a binary circular array nums, return the minimum number of swaps required to group all 1's present in the array together at any location.

Source: Minimum Swaps to Group All 1's Together II on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [0,1,0,1,1,0,0]
Output
1

# Example 2

Input
nums = [0,1,1,1,0,0,1,1,0]
Output
2

# Example 3

Input
nums = [1,1,0,0,1]
Output
0

Constraints

1 <= nums.length <= 10^5
nums[i] is either 0 or 1.

Related LeetCode Problems

Practice more problems similar to Minimum Swaps to Group All 1's Together II.

Review your practice with PhantomCodeAI

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