< Summary

Information
Class: LeetCode.Algorithms.MinimumSumOfFourDigitNumberAfterSplittingDigits.MinimumSumOfFourDigitNumberAfterSplittingDigitsNumbers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumSumOfFourDigitNumberAfterSplittingDigits\MinimumSumOfFourDigitNumberAfterSplittingDigitsNumbers.cs
Line coverage
100%
Covered lines: 10
Uncovered lines: 0
Coverable lines: 10
Total lines: 38
Line coverage: 100%
Branch coverage
100%
Covered branches: 2
Total branches: 2
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MinimumSum(...)100%22100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\MinimumSumOfFourDigitNumberAfterSplittingDigits\MinimumSumOfFourDigitNumberAfterSplittingDigitsNumbers.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.MinimumSumOfFourDigitNumberAfterSplittingDigits;
 13
 14/// <inheritdoc />
 15public class MinimumSumOfFourDigitNumberAfterSplittingDigitsNumbers : IMinimumSumOfFourDigitNumberAfterSplittingDigits
 16{
 17    /// <summary>
 18    ///     Time complexity - O(1)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="num"></param>
 22    /// <returns></returns>
 23    public int MinimumSum(int num)
 224    {
 225        var digits = new int[4];
 26
 2027        for (var i = 0; i < 4; i++)
 828        {
 829            digits[i] = num % 10;
 30
 831            num /= 10;
 832        }
 33
 234        Array.Sort(digits);
 35
 236        return (digits[0] * 10) + (digits[1] * 10) + digits[2] + digits[3];
 237    }
 38}

Methods/Properties

MinimumSum(System.Int32)