add 3541

Author: fishercoder1534

paginated_contents/algorithms/4th_thousand/README.md

@@ -80,6 +80,7 @@
 | 3569 | [Count Islands With Total Value Divisible by K](https://leetcode.com/problems/count-islands-with-total-value-divisible-by-k/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3569.java) |                                                                               | Medium     | Union Find
 | 3550 | [Smallest Index With Digit Sum Equal to Index](https://leetcode.com/problems/smallest-index-with-digit-sum-equal-to-index/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3550.java) |                                                                               | Easy       |
 | 3545 | [Minimum Deletions for At Most K Distinct Characters](https://leetcode.com/problems/minimum-deletions-for-at-most-k-distinct-characters/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3545.java) |                                                                               | Easy       |
+| 3541 | [Find Most Frequent Vowel and Consonant](https://leetcode.com/problems/find-most-frequent-vowel-and-consonant/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3541.java) |                                                                               | Easy       |
 | 3516 | [Find Closest Person](https://leetcode.com/problems/find-closest-person/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3516.java) |                                                                               | Easy       |
 | 3507 | [Minimum Pair Removal to Sort Array I](https://leetcode.com/problems/minimum-pair-removal-to-sort-array-i/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3507.java) |                                                                               | Easy       |
 | 3502 | [Minimum Cost to Reach Every Position](https://leetcode.com/problems/minimum-cost-to-reach-every-position/)                                                              | [Java](https://github.com/fishercoder1534/Leetcode/blob/master/src/main/java/com/fishercoder/solutions/fourththousand/_3502.java) |                                                                               | Easy       |

src/main/java/com/fishercoder/solutions/fourththousand/_3541.java

@@ -0,0 +1,29 @@
+package com.fishercoder.solutions.fourththousand;
+
+import java.util.*;
+
+public class _3541 {
+    public static class Solution1 {
+        public int maxFreqSum(String s) {
+            Set<Character> set = new HashSet<>(Arrays.asList('a', 'e', 'i', 'o', 'u'));
+            Map<Character, Integer> vowelMap = new HashMap<>();
+            Map<Character, Integer> consonantMap = new HashMap<>();
+            for (char c : s.toCharArray()) {
+                if (set.contains(c)) {
+                    vowelMap.put(c, vowelMap.getOrDefault(c, 0) + 1);
+                } else {
+                    consonantMap.put(c, consonantMap.getOrDefault(c, 0) + 1);
+                }
+            }
+            int maxV = 0;
+            for (Map.Entry<Character, Integer> entry : vowelMap.entrySet()) {
+                maxV = Math.max(maxV, entry.getValue());
+            }
+            int maxCon = 0;
+            for (Map.Entry<Character, Integer> entry : consonantMap.entrySet()) {
+                maxCon = Math.max(maxCon, entry.getValue());
+            }
+            return maxV + maxCon;
+        }
+    }
+}