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

Problem Description Problem: Minimum Difference Between Largest and Smallest Value in Three Moves Description: You need to remove up to 3 numbers from an integer array to minimize the difference between the largest and smallest values of the remain...