Minimum Difference Between Largest and Smallest Value in Three Moves - Leetcode 1509 - Java

Problem Description
Program to calculate the the minimum difference between the largest and smallest value in array nums after performing at most three moves where in one move one element of an array can be changed to anything.
Problem: leetcode.com/p...
Code link: k5kc.com/cs/al...