Want to know:

Divide and conquerFind character that occur less then k, using it to split the string int[] counts = new int[26]; for (char c: s.toCharArray()) { counts[c - 'a']++; } for (int i = 0; i < 26; i++) { if (counts[i] > 0 && counts[i] < k) { int max = 0; String[] subs = s.split((char)(i + 'a') + ""); for (String sub: subs) { max = Math.max(max, longestSubstring(sub, k)); } return max; } } return s.length();https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/

Get a detailed, AI-powered explanation for this question and thousands more on StudyFetch.