< Summary

Information
Class: LeetCode.Algorithms.MinimumDifferenceBetweenLargestAndSmallestValueInThreeMoves.MinimumDifferenceBetweenLargestAndSmallestValueInThreeMovesSorting
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumDifferenceBetweenLargestAndSmallestValueInThreeMoves\MinimumDifferenceBetweenLargestAndSmallestValueInThreeMovesSorting.cs
Line coverage
100%
Covered lines: 13
Uncovered lines: 0
Coverable lines: 13
Total lines: 44
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
MinDifference(...)100%44100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumDifferenceBetweenLargestAndSmallestValueInThreeMoves\MinimumDifferenceBetweenLargestAndSmallestValueInThreeMovesSorting.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 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.MinimumDifferenceBetweenLargestAndSmallestValueInThreeMoves;
 13
 14/// <inheritdoc />
 15public class MinimumDifferenceBetweenLargestAndSmallestValueInThreeMovesSorting :
 16    IMinimumDifferenceBetweenLargestAndSmallestValueInThreeMoves
 17{
 18    /// <summary>
 19    ///     Time complexity - O(n log n)
 20    ///     Space complexity - O(log n)
 21    /// </summary>
 22    /// <param name="nums"></param>
 23    /// <returns></returns>
 24    public int MinDifference(int[] nums)
 425    {
 426        if (nums.Length <= 4)
 227        {
 228            return 0;
 29        }
 30
 231        Array.Sort(nums);
 32
 233        var minDifference = int.MaxValue;
 34
 2035        for (var left = 0; left < 4; left++)
 836        {
 837            var right = nums.Length - 4 + left;
 38
 839            minDifference = Math.Min(minDifference, nums[right] - nums[left]);
 840        }
 41
 242        return minDifference;
 443    }
 44}

Methods/Properties

MinDifference(System.Int32[])