Add solution #1984

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,669 LeetCode solutions in JavaScript
+# 1,670 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1522,6 +1522,7 @@
 1980|[Find Unique Binary String](./solutions/1980-find-unique-binary-string.js)|Medium|
 1981|[Minimize the Difference Between Target and Chosen Elements](./solutions/1981-minimize-the-difference-between-target-and-chosen-elements.js)|Medium|
 1982|[Find Array Given Subset Sums](./solutions/1982-find-array-given-subset-sums.js)|Hard|
+1984|[Minimum Difference Between Highest and Lowest of K Scores](./solutions/1984-minimum-difference-between-highest-and-lowest-of-k-scores.js)|Easy|
 1985|[Find the Kth Largest Integer in the Array](./solutions/1985-find-the-kth-largest-integer-in-the-array.js)|Medium|
 1996|[The Number of Weak Characters in the Game](./solutions/1996-the-number-of-weak-characters-in-the-game.js)|Medium|
 2000|[Reverse Prefix of Word](./solutions/2000-reverse-prefix-of-word.js)|Easy|

solutions/1984-minimum-difference-between-highest-and-lowest-of-k-scores.js

@@ -0,0 +1,29 @@
+/**
+ * 1984. Minimum Difference Between Highest and Lowest of K Scores
+ * https://leetcode.com/problems/minimum-difference-between-highest-and-lowest-of-k-scores/
+ * Difficulty: Easy
+ *
+ * You are given a 0-indexed integer array nums, where nums[i] represents the score of the
+ * ith student. You are also given an integer k.
+ *
+ * Pick the scores of any k students from the array so that the difference between the highest
+ * and the lowest of the k scores is minimized.
+ *
+ * Return the minimum possible difference.
+ */
+
+/**
+ * @param {number[]} nums
+ * @param {number} k
+ * @return {number}
+ */
+var minimumDifference = function(nums, k) {
+  nums.sort((a, b) => a - b);
+  let result = Infinity;
+
+  for (let i = 0; i <= nums.length - k; i++) {
+    result = Math.min(result, nums[i + k - 1] - nums[i]);
+  }
+
+  return result;
+};