Dunzo Minimum Adjacent Swaps for K Zeros
Dunzo Minimum Adjacent Swaps for K Zeros
HardSliding Window0% accepted
Dunzo delivery slots are binary: 1=available, 0=busy. Gather k consecutive available slots by swapping adjacent elements. Find the minimum swaps needed.
Approach
Minimum adjacent swaps to group k ones together in a binary array.
Input
5 2
1 0 1 0 1
Output
1
More Sliding Window problems
Browse all coding problems →solution.py
Loading editor...
Test 1
Test 2
Test 3
Press Run to test your custom input, or Submit to judge against all test cases.
Sign in to continue
Create a free account to run code, submit solutions and track progress.
- Free forever — no credit card
- 10+ languages with live execution
- Points, streaks & leaderboards