< Summary

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

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
LargestGoodInteger(...)100%1010100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\LargestThreeSameDigitNumberInString\LargestThreeSameDigitNumberInStringGreedy.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.LargestThreeSameDigitNumberInString;
 13
 14/// <inheritdoc />
 15public class LargestThreeSameDigitNumberInStringGreedy : ILargestThreeSameDigitNumberInString
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(1)
 20    /// </summary>
 21    /// <param name="num"></param>
 22    /// <returns></returns>
 23    public string LargestGoodInteger(string num)
 524    {
 525        var maxChar = '\0';
 26
 5627        for (var i = 0; i <= num.Length - 3; i++)
 2328        {
 2329            if (num[i] == num[i + 1] && num[i] == num[i + 2] && num[i] > maxChar)
 430            {
 431                maxChar = num[i];
 432            }
 2333        }
 34
 535        return maxChar == '\0' ? "" : new string(maxChar, 3);
 536    }
 37}