1984. Minimum Difference Between Highest and Lowest of K Scores

/**
 * Problem: LeetCode 1984 - Minimum Difference Between Highest and Lowest of K Scores
 * Difficulty: Easy
 * Language: Java
 * Author: CodeByTushu
 */
import java.util.Arrays;

class Solution {
    public int minimumDifference(int[] nums, int k) {
        if (k <= 1) {
            return 0;
        }

        Arrays.sort(nums);
        int minDiff = Integer.MAX_VALUE;

        for (int i = 0; i + k - 1 < nums.length; i++) {
            int currentDiff = nums[i + k - 1] - nums[i];
            minDiff = Math.min(minDiff, currentDiff);
        }

        return minDiff;
    }
}

"""
Problem: LeetCode 1984 - Minimum Difference Between Highest and Lowest of K Scores
Difficulty: Easy
Language: Python
Author: CodeByTushu
"""
from typing import List

class Solution:
    def minimumDifference(self, nums: List[int], k: int) -> int:
        if k <= 1:
            return 0

        nums.sort()
        min_diff = float('inf')

        for i in range(len(nums) - k + 1):
            current_diff = nums[i + k - 1] - nums[i]
            if current_diff < min_diff:
                min_diff = current_diff

        return min_diff

/**
 * Problem: LeetCode 1984 - Minimum Difference Between Highest and Lowest of K Scores
 * Difficulty: Easy
 * Language: C++
 * Author: CodeByTushu
 */
#include <vector>
#include <algorithm>
#include <climits>

using namespace std;

class Solution {
public:
    int minimumDifference(vector<int>& nums, int k) {
        if (k <= 1) {
            return 0;
        }

        sort(nums.begin(), nums.end());
        int minDiff = INT_MAX;

        for (int i = 0; i + k - 1 < static_cast<int>(nums.size()); i++) {
            int currentDiff = nums[i + k - 1] - nums[i];
            minDiff = min(minDiff, currentDiff);
        }

        return minDiff;
    }
};

/**
 * Problem: LeetCode 1984 - Minimum Difference Between Highest and Lowest of K Scores
 * Difficulty: Easy
 * Language: JavaScript
 * Author: CodeByTushu
 */
/**
 * @param {number[]} nums
 * @param {number} k
 * @return {number}
 */
var minimumDifference = function(nums, k) {
    if (k <= 1) {
        return 0;
    }

    nums.sort((a, b) => a - b);
    let minDiff = Infinity;

    for (let i = 0; i + k - 1 < nums.length; i++) {
        const currentDiff = nums[i + k - 1] - nums[i];
        if (currentDiff < minDiff) {
            minDiff = currentDiff;
        }
    }

    return minDiff;
};