Group 1s and 0s with Minimum Swaps
Filed under Acko
The question
Given an array containing only binary values, group all 1s on the left side and 0s on the right side using the minimum number of swaps.
No write-up yet. Related questions below have one.
Related Acko questions
Collected from public candidate posts and coding forums. Updated Nov 2026.