< Summary

Information
Class: LeetCode.Algorithms.FindMostFrequentVowelAndConsonant.FindMostFrequentVowelAndConsonantFrequencyArray
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindMostFrequentVowelAndConsonant\FindMostFrequentVowelAndConsonantFrequencyArray.cs
Line coverage
100%
Covered lines: 21
Uncovered lines: 0
Coverable lines: 21
Total lines: 55
Line coverage: 100%
Branch coverage
100%
Covered branches: 16
Total branches: 16
Branch coverage: 100%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
MaxFreqSum(...)100%44100%
IsVowel(...)100%1212100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindMostFrequentVowelAndConsonant\FindMostFrequentVowelAndConsonantFrequencyArray.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.FindMostFrequentVowelAndConsonant;
 13
 14/// <inheritdoc />
 15public sealed class FindMostFrequentVowelAndConsonantFrequencyArray : IFindMostFrequentVowelAndConsonant
 16{
 17    private const byte AlphabetLength = 'z' - 'a' + 1;
 18
 19    /// <summary>
 20    ///     Time complexity - O(n)
 21    ///     Space complexity - O(1)
 22    /// </summary>
 23    /// <param name="s"></param>
 24    /// <returns></returns>
 25    public int MaxFreqSum(string s)
 226    {
 227        Span<byte> frequencyArray = stackalloc byte[AlphabetLength];
 28
 229        var maxVowel = 0;
 230        var maxConsonant = 0;
 31
 3832        foreach (var c in s)
 1633        {
 1634            var index = c - 'a';
 35
 1636            frequencyArray[index]++;
 37
 1638            if (IsVowel(c))
 1039            {
 1040                maxVowel = Math.Max(maxVowel, frequencyArray[index]);
 1041            }
 42            else
 643            {
 644                maxConsonant = Math.Max(maxConsonant, frequencyArray[index]);
 645            }
 1646        }
 47
 248        return maxVowel + maxConsonant;
 249    }
 50
 51    private static bool IsVowel(char c)
 1652    {
 1653        return c is 'a' or 'e' or 'i' or 'o' or 'u';
 1654    }
 55}