Minimum Difference Between Largest and Smallest Value in Three Moves LeetCode solution in JavaScript

1
var minDifference = function (nums) {
2
  let len = nums.length;
3
  if (len < 5) return 0;
4

5
  nums.sort((a, b) => a - b);
6

7
  return Math.min(
8
    nums[len - 1] - nums[3], // 3 elements removed from start 0 from end
9
    nums[len - 4] - nums[0], // 3 elements removed from end 0 from start
10
    nums[len - 2] - nums[2], // 2 elements removed from start 1 from end
11
    nums[len - 3] - nums[1] // 2 elements removed from end 1 from start
12
  );
13
};