# Check If Array Pairs Are Divisible By K: Walkthrough
Check If Array Pairs Are Divisible By K shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Pair all elements so each pair sums to a multiple of k. Count residues r and k-r; each must match, residue 0 and (if k even) k/2 must be even counts. Negative nums need a positive remainder ((x % k) + k) % k.
## 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
Using signed remainders, or forgetting that 0 and k/2 pair with themselves.
## 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 learn more.