package com.fishercoder.solutions;

/**
 * 1062. Longest Repeating Substring
 *
 * Given a string S, find out the length of the longest repeating substring(s). Return 0 if no repeating substring exists.
 *
 * Example 1:
 * Input: "abcd"
 * Output: 0
 * Explanation: There is no repeating substring.
 *
 * Example 2:
 * Input: "abbaba"
 * Output: 2
 * Explanation: The longest repeating substrings are "ab" and "ba", each of which occurs twice.
 *
 * Example 3:
 * Input: "aabcaabdaab"
 * Output: 3
 * Explanation: The longest repeating substring is "aab", which occurs 3 times.
 *
 * Example 4:
 * Input: "aaaaa"
 * Output: 4
 * Explanation: The longest repeating substring is "aaaa", which occurs twice.
 *
 * Note:
 * The string S consists of only lowercase English letters from 'a' - 'z'.
 * 1 <= S.length <= 1500
 * */
public class _1062 {
    public static class Solution1 {
        public int longestRepeatingSubstring(String S) {
            //TODO: implement it
            return 0;
        }
    }
}

@@ -33,795 +33,8 @@
 s;%0A%0A
-/**%0A * 1062. Longest Repeating Substring%0A *%0A * Given a string S, find out the length of the longest repeating substring(s). Return 0 if no repeating substring exists.%0A *%0A * Example 1:%0A * Input: %22abcd%22%0A * Output: 0%0A * Explanation: There is no repeating substring.%0A *%0A * Example 2:%0A * Input: %22abbaba%22%0A * Output: 2%0A * Explanation: The longest repeating substrings are %22ab%22 and %22ba%22, each of which occurs twice.%0A *%0A * Example 3:%0A * Input: %22aabcaabdaab%22%0A * Output: 3%0A * Explanation: The longest repeating substring is %22aab%22, which occurs 3 times.%0A *%0A * Example 4:%0A * Input: %22aaaaa%22%0A * Output: 4%0A * Explanation: The longest repeating substring is %22aaaa%22, which occurs twice.%0A *%0A * Note:%0A * The string S consists of only lowercase English letters from 'a' - 'z'.%0A * 1 %3C= S.length %3C= 1500%0A * */%0A
 publ

refactor 1062