Available question text
Given a binary array, find the minimum number of swaps required to make all 1's contiguous by grouping them together; this reduces to locating a subarray of length equal to the total number of 1's that contains the fewest zeros (sliding-window pattern).
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 1151. Minimum Swaps to Group All 1's Together
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source