< Summary

Information
Class: LeetCode.Algorithms.FindMostFrequentVowelAndConsonant.FindMostFrequentVowelAndConsonantFrequencyDictionary
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindMostFrequentVowelAndConsonant\FindMostFrequentVowelAndConsonantFrequencyDictionary.cs
Line coverage
100%
Covered lines: 23
Uncovered lines: 0
Coverable lines: 23
Total lines: 54
Line coverage: 100%
Branch coverage
100%
Covered branches: 18
Total branches: 18
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%66100%
IsVowel(...)100%1212100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\FindMostFrequentVowelAndConsonant\FindMostFrequentVowelAndConsonantFrequencyDictionary.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.FindMostFrequentVowelAndConsonant;
 13
 14/// <inheritdoc />
 15public class FindMostFrequentVowelAndConsonantFrequencyDictionary : IFindMostFrequentVowelAndConsonant
 16{
 17    /// <summary>
 18    ///     Time complexity - O(n)
 19    ///     Space complexity - O(n)
 20    /// </summary>
 21    /// <param name="s"></param>
 22    /// <returns></returns>
 23    public int MaxFreqSum(string s)
 224    {
 225        var frequencyDictionary = new Dictionary<char, int>();
 26
 227        var maxVowel = 0;
 228        var maxConsonant = 0;
 29
 3830        foreach (var c in s)
 1631        {
 1632            if (!frequencyDictionary.TryAdd(c, 1))
 933            {
 934                frequencyDictionary[c]++;
 935            }
 36
 1637            if (IsVowel(c))
 1038            {
 1039                maxVowel = Math.Max(maxVowel, frequencyDictionary[c]);
 1040            }
 41            else
 642            {
 643                maxConsonant = Math.Max(maxConsonant, frequencyDictionary[c]);
 644            }
 1645        }
 46
 247        return maxVowel + maxConsonant;
 248    }
 49
 50    private static bool IsVowel(char c)
 1651    {
 1652        return c is 'a' or 'e' or 'i' or 'o' or 'u';
 1653    }
 54}