Add solution #1509

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,337 LeetCode solutions in JavaScript
+# 1,338 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1153,6 +1153,7 @@
 1505|[Minimum Possible Integer After at Most K Adjacent Swaps On Digits](./solutions/1505-minimum-possible-integer-after-at-most-k-adjacent-swaps-on-digits.js)|Hard|
 1507|[Reformat Date](./solutions/1507-reformat-date.js)|Easy|
 1508|[Range Sum of Sorted Subarray Sums](./solutions/1508-range-sum-of-sorted-subarray-sums.js)|Medium|
+1509|[Minimum Difference Between Largest and Smallest Value in Three Moves](./solutions/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.js)|Medium|
 1512|[Number of Good Pairs](./solutions/1512-number-of-good-pairs.js)|Easy|
 1519|[Number of Nodes in the Sub-Tree With the Same Label](./solutions/1519-number-of-nodes-in-the-sub-tree-with-the-same-label.js)|Medium|
 1524|[Number of Sub-arrays With Odd Sum](./solutions/1524-number-of-sub-arrays-with-odd-sum.js)|Medium|

solutions/1509-minimum-difference-between-largest-and-smallest-value-in-three-moves.js

@@ -0,0 +1,32 @@
+/**
+ * 1509. Minimum Difference Between Largest and Smallest Value in Three Moves
+ * https://leetcode.com/problems/minimum-difference-between-largest-and-smallest-value-in-three-moves/
+ * Difficulty: Medium
+ *
+ * You are given an integer array nums.
+ *
+ * In one move, you can choose one element of nums and change it to any value.
+ *
+ * Return the minimum difference between the largest and smallest value of nums after performing at
+ * most three moves.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var minDifference = function(nums) {
+  if (nums.length <= 4) return 0;
+
+  nums.sort((a, b) => a - b);
+
+  const n = nums.length;
+  let result = Infinity;
+
+  result = Math.min(result, nums[n - 1] - nums[3]);
+  result = Math.min(result, nums[n - 2] - nums[2]);
+  result = Math.min(result, nums[n - 3] - nums[1]);
+  result = Math.min(result, nums[n - 4] - nums[0]);
+
+  return result;
+};