# Minimize Deviation In Array: Interview Notes
Minimize Deviation In Array shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Multiply every odd number by 2 so each value starts at its maximum even form, then put them in a max-heap. Repeatedly replace the current max with max/2 while it is even, and track max-min after every step.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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 log A).
## Common mistake
Only decreasing the global max once, which misses a later better deviation after several halves.
## 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 AI interview assistant.