You are given an integer array nums representing the scores of students and an integer k.

Choose the scores of any k students from nums such that the difference between the highest score and the lowest score among the chosen k scores is minimized.

Return the minimum possible difference.

Constraints:

• $1 \leq$ k $\leq$ nums.length $\leq 1000$

• $0 \leq$ nums[i] $\leq 10^5$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.