_1297.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.HashMap;
importjava.util.HashSet;
importjava.util.Map;
importjava.util.Set;

publicclass_1297 {
publicstaticclassSolution1 {
publicintmaxFreq(Strings, intmaxLetters, intminSize, intmaxSize) {
intmaxFreq = 0;
for (intsize = minSize; size <= maxSize; size++) {
maxFreq = Math.max(maxFreq, getMaxFreqWithThisSize(s, maxLetters, size));
 }
returnmaxFreq;
 }

privateintgetMaxFreqWithThisSize(Stringstr, intmaxLetters, intsize) {
Map<String, Integer> map = newHashMap<>();
for (inti = 0; i <= str.length() - size; i++) {
Stringsubstring = str.substring(i, i + size);
Set<Character> set = newHashSet<>();
for (intj = 0; j < substring.length(); j++) {
set.add(substring.charAt(j));
if (set.size() > maxLetters) {
break;
 }
 }
if (set.size() <= maxLetters) {
map.put(substring, map.getOrDefault(substring, 0) + 1);
 }
 }
intmax = 0;
for (Stringkey : map.keySet()) {
max = Math.max(max, map.get(key));
 }
returnmax;
 }
 }
}