3872. Find Most Frequent Vowel And Consonant¶

LeetCode Problem View on GitHub

3872. Find Most Frequent Vowel and Consonant

Easy

You are given a string s consisting of lowercase English letters ('a' to 'z').

Your task is to:

• Find the vowel (one of 'a', 'e', 'i', 'o', or 'u') with the maximum frequency.
• Find the consonant (all other letters excluding vowels) with the maximum frequency.

Return the sum of the two frequencies.

Note: If multiple vowels or consonants have the same maximum frequency, you may choose any one of them. If there are no vowels or no consonants in the string, consider their frequency as 0.

The frequency of a letter x is the number of times it occurs in the string.

Example 1:

Example 2:

Constraints:

• 1 <= s.length <= 100
• s consists of lowercase English letters only.

Solution¶

class Solution {
    public int maxFreqSum(String s) {
        int n = s.length();
        int freq[] = new int[26];
        int maxiV = 0, maxiC = 0;
        for (int i = 0; i < n; i++) {
            char current = s.charAt(i);
            freq[s.charAt(i) - 'a']++;
            if (current == 'a' || current == 'e' || current == 'i' || current == 'o' || current == 'u')
                maxiV = Math.max(maxiV, freq[current - 'a']);
            else 
                maxiC = Math.max(maxiC, freq[current - 'a']);            
        } 
        return maxiV + maxiC;
    }
}

Complexity Analysis¶

• Time Complexity: O(?)
• Space Complexity: O(?)

Approach¶

Detailed explanation of the approach will be added here