Search
⌘K
Get Premium
Leetcode 1675. Minimize Deviation in Array
Given an array of positive integers where you may repeatedly halve even numbers and can double odd numbers (to make them even), compute the minimum possible deviation (max − min) achievable by any sequence of operations. The core challenge is choosing which elements to shrink—typically by normalizing odds then greedily reducing the current maximum while tracking the running minimum to minimize the spread.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.