package leetcode;

/**
 * https://leetcode.com/problems/longest-substring-with-at-least-k-repeating-characters/
 */
public class Problem395 {
    public int longestSubstring(String s, int k) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem395 prob = new Problem395();
        System.out.println(prob.longestSubstring("aaabb", 3)); // 3
        System.out.println(prob.longestSubstring("ababbc", 2)); // 5
    }
}

@@ -453,16 +453,371 @@
 ); // 5%0A
+        System.out.println(prob.longestSubstring(%22aaabcb%22, 3)); // 3%0A        System.out.println(prob.longestSubstring(%22aaabcbc%22, 2)); // 7%0A        System.out.println(prob.longestSubstring(%22aadabcbc%22, 2)); // 4%0A        System.out.println(prob.longestSubstring(%22aadabcbcd%22, 2)); // 9%0A        System.out.println(prob.longestSubstring(%22aadabdbbdc%22, 2)); // 9%0A
     %7D%0A%7D%0A

Update problem 395