# Make K Subarray Sums Equal: Practice Notes
Make K Subarray Sums Equal shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
You may add 1 or subtract 1 from any element; make every k-length circular subarray have the same sum. That forces arr[i] == arr[i+k] (circularly), so each residue class modulo gcd(k, n) must become equal; cost is convert-to-median in each class.
## 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 log n).
## Common mistake
Treating the array as linear (dropping the circular wrap) or converting each class to its mean instead of its median.
## 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 help for online coding assessments.