1509. Minimum Difference Between Largest and Smallest Value in Three Moves

[@pjac744]

Great explanation. Just a suggestion. You can cascade any number of arguments to the min/max function in this way
a = min({op1,op2,op3,op4});

[@mohammadfraz]

Thanks a lot ☺️

[@bhaskargurram94]

Sorting will take you O(nlogn). You just need the 4 smallest and 4 largest elements which can be done in O(n)

[@mohammadfraz]

Actually if you sort , you will be able to make the solution generalised for k which is 3 in this question.

[@kumarc4853]

@@mohammadfraz question is for 3 moves, so o(n) is faster

[@pisanghangus2]

i go crazy figuring the solution, thanks

[@MrFrazerz]

I am confused on why you can sort the array. I thought you can only change an element within one move of itself, so I could only change nums[i] to either nums[i-1] or nums[i+1].

[@MrFrazerz]

I guess that leads me to wonder what is exactly defined as a move because my understanding must not be right. If my understanding were right, we wouldn't be able to sort the array in the problem.

[@yuzhao5268]

you dont have to sort the whole array. you can do it in O(n)

[@shantanukumar4081]

Great Explanation !!!!

[@nos44-]

everything was fine,... even i solved the problem , the same way and it got accepted..... until i saw TM Williams solution 😭... he did it in just a single loop .... and a single statement 😥

[@ratnasanjay]

Thankyou bhaiya for this video

[@code7434]

😉thanks

[@mohammadfraz]

Hi , sup 😄.

[@a-gamephile5613]

Nice video!

[@techwech8265]

Worst Video ever ..where is the intuition ? Just explaining the solution doesn't helps lol !