Update 3541-find-most-frequent-vowel-and-consonant.java

Author: sanajitjana

Easy/3541-find-most-frequent-vowel-and-consonant.java

@@ -1,3 +1,58 @@
+/**
+ * Problem: Maximum Frequency Sum (custom problem)
+ * Difficulty: Easy
+ * 
+ * Description:
+ * - Given a string, count the frequencies of vowels and consonants.
+ * - Find the maximum frequency among vowels and the maximum frequency among consonants.
+ * - Return the sum of these two maximum frequencies.
+ * 
+ * Approach:
+ * - Pre-mark vowels in a boolean array of size 26 for O(1) lookup.
+ * - Use two frequency arrays (size 26) to count vowels and consonants separately.
+ * - Iterate over each character in the string:
+ *   - If it's a vowel, increment its count in the vowel frequency array.
+ *   - Otherwise, increment its count in the consonant frequency array.
+ * - Scan both frequency arrays to find max frequency among vowels and consonants.
+ * - Return their sum.
+ * 
+ * Time Complexity: O(n + 26) ≈ O(n), where n = length of the string
+ * Space Complexity: O(26) ≈ O(1), constant extra space
+ */
+
+class Solution {
+    public int maxFreqSum(String s) {
+
+        boolean[] vowels = new boolean[26];
+        for (char ch : new char[] { 'a', 'e', 'i', 'o', 'u' }) {
+            vowels[ch - 'a'] = true;
+        }
+
+        int[] vowFreq = new int[26];
+        int[] conFreq = new int[26];
+
+        for (char ch : s.toCharArray()) {
+            int index = ch - 'a';
+            if (vowels[index]) {
+                vowFreq[index]++;
+            } else {
+                conFreq[index]++;
+            }
+        }
+
+        int maxVow = 0;
+        int maxCon = 0;
+        for (int i = 0; i < 26; i++) {
+            maxVow = Math.max(maxVow, vowFreq[i]);
+            maxCon = Math.max(maxCon, conFreq[i]);
+        }
+
+        return maxVow + maxCon;
+    }
+}
+
+
+
 /**
  * Problem: Maximum Frequency Sum (custom problem)
  * Difficulty: Easy