How should I practice Minimize Range After Three Changes?

Start by reading the full statement, solve the visible examples, then compare the pattern against related DRW phone screen problems in FastPrep.

Is Minimize Range After Three Changes associated with DRW?

FastPrep tags this as a DRW phone screen coding practice problem when the problem catalog has that company and stage context.

DRW● MediumINTERNPHONE SCREEN

You are given an integer array nums. You may change the value of at most three elements to any integers.

Return the minimum possible difference between the largest and smallest values after the changes.

minimizeRange(nums: int[]) → int

nums = [5,3,2,4]return = 0

Change three values to match the remaining value, so the range becomes 0.

nums = [1,5,6,14,15]return = 1

Keep 5 and 6 and change the other three elements.

nums = [6,6,0,1,1,4,6]return = 2

Changing 0, both 1s, or an equivalent set leaves values between 4 and 6.