Help understanding the question?
As of 7/28/2021, this is the description of the problem. \n\nGiven an array nums, you are allowed to choose one element of nums and change it by any value in on
As of 7/28/2021, this is the description of the problem. \n```\nGiven an array nums, you are allowed to choose one element of nums and change it by any value in one move.\n\nReturn the minimum difference between the largest and smallest value of nums after perfoming at most 3 moves.\n```\nAm I missing something here? \n\nIf I can take any element of nums and change it to anything, why wouldn\'t I just change max(nums) to min(nums) in very first move and always return the difference of 0? \n\nDid nobody else have a problem understanding the question?
[]