Available question text
Given a binary circular array, find the minimum number of swaps needed to group all 1's contiguously anywhere in the circle. This reduces to finding a length-k circular window (k = total number of 1's) with the fewest 0's — a sliding-window/linear-time optimization over the circular array.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2134. Minimum Swaps to Group All 1's Together II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source