Minimize Deviation in Array

HardHeapheap

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

You are given an array nums of positive integers. You may apply these operations to any element, any number of times, in any order: - if the element is **even**, divide it by 2; - if the element is **odd**, multiply it by 2. The **deviation** of the array is its maximum element minus its minimum element. Return the smallest deviation you can reach.

Examples

Input: nums = [1,2,3,4]
Output: 1
Double 1 to 2 and halve 4 to 2, giving [2,2,3,2] with deviation 3 - 2 = 1.
Input: nums = [4,1,5,20,3]
Output: 3
Halve 4 to 2, double 1 to 2, halve 20 twice to 5: [2,2,5,5,3] has deviation 5 - 2 = 3.
Input: nums = [2,10,8]
Output: 3
Halve 10 to 5 and halve 8 twice to 2, giving [2,5,2] with deviation 5 - 2 = 3.

Constraints

  • 2 <= nums.length <= 5 * 10^4
  • 1 <= nums[i] <= 10^9

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More heap problems