# Minimum Number Of Adjacent Swaps To Make Binary String K Periodic: Explained

Minimum Number Of Adjacent Swaps To Make Binary String K Periodic shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Count how many 1s sit off each residue class modulo k (or whichever periodicity the prompt defines) and compute the swaps to gather them; pick the cheaper target pattern.

## 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

Generating every rotation and simulating swaps.

## 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 AI job search and interview copilot.