## Minimum Difference Between Highest and Lowest of K Scores solution leetcode

You are given a **0-indexed** integer array `nums`

, where `nums[i]`

represents the score of the `i`

student. You are also given an integer ^{th}`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*. Minimum Difference Between Highest and Lowest of K Scores solution leetcode

**Example 1:**

Input:nums = [90], k = 1Output:0Explanation:There is one way to pick score(s) of one student: - []. The difference between the highest and lowest score is 90 - 90 = 0. The minimum possible difference is 0.90

**Example 2: Minimum Difference Between Highest and Lowest of K Scores solution leetcode **

Input:nums = [9,4,1,7], k = 2Output:2Explanation:There are six ways to pick score(s) of two students: - [,9,1,7]. The difference between the highest and lowest score is 9 - 4 = 5. - [4,4,9,7]. The difference between the highest and lowest score is 9 - 1 = 8. - [1,4,1,9]. The difference between the highest and lowest score is 9 - 7 = 2. - [9,7,4,7]. The difference between the highest and lowest score is 4 - 1 = 3. - [9,1,1,4]. The difference between the highest and lowest score is 7 - 4 = 3. - [9,4,7,1]. The difference between the highest and lowest score is 7 - 1 = 6. The minimum possible difference is 2.7

**Constraints: Minimum Difference Between Highest and Lowest of K Scores solution leetcode **

`1 <= k <= nums.length <= 1000`

`0 <= nums[i] <= 10`

^{5}