# Minimum Adjacent Swaps For K Consecutive Ones: Practice Notes

Minimum Adjacent Swaps For K Consecutive Ones shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

nums is 0/1; make k ones occupy k consecutive positions with the fewest adjacent swaps. Collect positions of ones; a swap moves a 1 by one index, so cost to gather onesi..i+k) onto a median-centered window is a prefix-sum of distances. Slide the window of k ones and take the min.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n).

## Common mistake

Moving ones independently to the left without using the median, which is not optimal.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at [multilingual AI interview assistant
.