hardArrayGreedyHeap Priority QueueOrdered Set 0 views

Minimize Deviation in Array

You are given an array nums of n positive integers.

You are given an array nums of n positive integers.

You can perform two types of operations on any element of the array any number of times:

The deviation of the array is the maximum difference between any two elements in the array.

Return the minimum deviation the array can have after performing some number of operations.

Minimize Deviation in Array diagram

Example 1

Input: nums = [1,2,3,4]

Output: 1

Explanation: You can transform the array to [1,2,3,2], then to [2,2,3,2], then the deviation will be 3 - 2 = 1.

Example 2

Input: nums = [4,1,5,20,3]

Output: 3

Explanation: You can transform the array after two operations to [4,2,5,5,3], then the deviation will be 5 - 2 = 3.

Example 3

Input: nums = [2,10,8]

Output: 3

Constraints

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

Hints

Companies

No companies reported yet.

Discussion

Sign in to join the discussion.

Loading discussion...

Test results

No test cases yet.