Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Minimize Length of Array Using Operations
Coding
- Minimize Maximum of Array
Coding
- Minimize Maximum Pair Sum in Array
Coding
- Partition Array Into Two Arrays to Minimize Sum Difference
Coding · Array · Binary Search · Bit Manipulation
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1675. Minimize Deviation in Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source