Include leetcode problem.

Author: ZahidFKhan

src/test/java/com/github/streams/practice/b_medium/strings/StringProblemsSolution.java

@@ -80,4 +80,28 @@ public static List<String> findDuplicateStrings(List<String> input) {
   public static String convertListOfCharactersToString(Collection<Character> listOfCharacters) {
     return listOfCharacters.stream().map(Object::toString).reduce("", String::concat);
   }
+  public static int frequentVowelPlusConstant(String s){
+    final var vowels = Set.of('a', 'e', 'i', 'o', 'u');
+    final var vowelsValue = s.chars()
+            .mapToObj(e -> Character.valueOf((char) e))
+            .filter(vowels::contains)
+            .collect(Collectors.toMap(Function.identity(), c -> 1, Integer::sum))
+            .entrySet()
+            .stream()
+            .max(Map.Entry.comparingByValue())
+            .map(Map.Entry::getValue)
+            .orElse(0);
+
+    final var constValue = s.chars()
+            .mapToObj(e -> Character.valueOf((char) e))
+            .filter(e->!vowels.contains(e))
+            .collect(Collectors.toMap(Function.identity(), c -> 1, Integer::sum))
+            .entrySet()
+            .stream()
+            .max(Map.Entry.comparingByValue())
+            .map(Map.Entry::getValue)
+            .orElse(0);
+
+    return vowelsValue + constValue;
+  }
 }

src/test/java/com/github/streams/practice/b_medium/strings/problems/Q_FrequentVowelPlusConstant.java

@@ -0,0 +1,70 @@
+package com.github.streams.practice.b_medium.strings.problems;
+
+import com.github.streams.practice.b_medium.strings.StringProblemsSolution;
+import org.junit.jupiter.api.Assertions;
+import org.junit.jupiter.api.Disabled;
+import org.junit.jupiter.api.Test;
+
+///
+ /// 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:
+ ///
+ /// Input: s = "successes"
+ ///
+ /// Output: 6
+ ///
+ /// Explanation:
+ ///
+ /// The vowels are: 'u' (frequency 1), 'e' (frequency 2). The maximum frequency is 2.
+ /// The consonants are: 's' (frequency 4), 'c' (frequency 2). The maximum frequency is 4.
+ /// The output is 2 + 4 = 6.
+ /// Example 2:
+ ///
+ /// Input: s = "aeiaeia"
+ ///
+ /// Output: 3
+ ///
+ /// Explanation:
+ ///
+ /// The vowels are: 'a' (frequency 3), 'e' ( frequency 2), 'i' (frequency 2). The maximum frequency is 3.
+ /// There are no consonants in s. Hence, maximum consonant frequency = 0.
+ /// The output is 3 + 0 = 3.
+ ///
+ ///
+ /// Constraints:
+ ///
+ /// 1 <= s.length <= 100
+ /// s consists of lowercase English letters only.
+ ///
+ ///
+ ///
+ ///
+ ///
+ ///
+ ///
+class Q_FrequentVowelPlusConstant {
+
+    @Test
+    @Disabled
+    void freqVowelsPlusConstant() {
+        final var input = "successes";
+        final var mySolution = StringProblemsSolution.frequentVowelPlusConstant(input);
+        final var yourSolution = -1;
+
+        Assertions.assertEquals(mySolution, yourSolution);
+    }
+}