# Sort Array By Parity II: Explained
Sort Array By Parity II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Even indices must hold evens and odd indices odds. Walk an even pointer and an odd pointer and swap whenever a slot has the wrong parity.
## 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
Collecting evens and odds into extra arrays without writing them back on the parity-correct indices.
## 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 Linkjob.