< Summary

Information
Class: LeetCode.Algorithms.MinimumDifferenceBetweenHighestAndLowestOfKScores.MinimumDifferenceBetweenHighestAndLowestOfKScoresSortingSlidingWindow
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumDifferenceBetweenHighestAndLowestOfKScores\MinimumDifferenceBetweenHighestAndLowestOfKScoresSortingSlidingWindow.cs
Line coverage
100%
Covered lines: 15
Uncovered lines: 0
Coverable lines: 15
Total lines: 48
Line coverage: 100%
Branch coverage
100%
Covered branches: 4
Total branches: 4
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MinimumDifference(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumDifferenceBetweenHighestAndLowestOfKScores\MinimumDifferenceBetweenHighestAndLowestOfKScoresSortingSlidingWindow.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2026 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12namespace LeetCode.Algorithms.MinimumDifferenceBetweenHighestAndLowestOfKScores;
 13
 14/// <inheritdoc />
 15public sealed class MinimumDifferenceBetweenHighestAndLowestOfKScoresSortingSlidingWindow :
 16    IMinimumDifferenceBetweenHighestAndLowestOfKScores
 17{
 18    /// <summary>
 19    ///     Time complexity - O(n log n)
 20    ///     Space complexity - O(log n)
 21    /// </summary>
 22    /// <param name="nums"></param>
 23    /// <param name="k"></param>
 24    /// <returns></returns>
 25    public int MinimumDifference(int[] nums, int k)
 426    {
 427        if (k < 2)
 128        {
 129            return 0;
 30        }
 31
 332        Array.Sort(nums);
 33
 334        var minimumDifference = int.MaxValue;
 35
 1836        for (var i = 0; i < nums.Length - k + 1; i++)
 637        {
 638            var min = nums[i];
 639            var max = nums[i + k - 1];
 40
 641            var difference = max - min;
 42
 643            minimumDifference = Math.Min(minimumDifference, difference);
 644        }
 45
 346        return minimumDifference;
 447    }
 48}