add 1062

Author: fishercoder1534

README.md

@@ -480,7 +480,7 @@ _If you like this project, please leave me a star._ ★
 |1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1071.java) |  |Easy||
 |1066|[Campus Bikes II](https://leetcode.com/problems/campus-bikes-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1066.java) | |Medium|Backtracking, DP|
 |1065|[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1065.java) | |Medium||
-|1062|[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1062.java) | |Medium||
+|1062|[Longest Repeating Substring](https://leetcode.com/problems/longest-repeating-substring/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1062.java) | |Medium|String, Binary Search, DP, Rolling Hash, Suffix Array, Hash Function|
 |1057|[Campus Bikes](https://leetcode.com/problems/campus-bikes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1057.java) | |Medium||Greedy, Sort
 |1056|[Confusing Number](https://leetcode.com/problems/confusing-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1056.java) | |Easy||
 |1055|[Fixed Point](https://leetcode.com/problems/fixed-point/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1055.java) |  |Easy||

src/main/java/com/fishercoder/solutions/_1062.java

@@ -1,9 +1,24 @@
 package com.fishercoder.solutions;
 
+import java.util.HashSet;
+import java.util.Set;
+
 public class _1062 {
     public static class Solution1 {
-        public int longestRepeatingSubstring(String S) {
-            //TODO: implement it
+        /**
+         * My completely original, although brute-force solution, on 1/20/2022.
+         */
+        public int longestRepeatingSubstring(String s) {
+            Set<String> seen = new HashSet<>();
+            for (int j = s.length() - 1; j > 0; j--) {
+                int len = j;
+                for (int i = 0; i <= s.length() - j; i++) {
+                    if (!seen.add(s.substring(i, i + len))) {
+                        return len;
+                    }
+                }
+                seen.clear();
+            }
             return 0;
         }
     }

src/test/java/com/fishercoder/_1062Test.java

@@ -2,12 +2,10 @@
 
 import com.fishercoder.solutions._1062;
 import org.junit.BeforeClass;
-import org.junit.Ignore;
 import org.junit.Test;
 
 import static org.junit.Assert.assertEquals;
 
-@Ignore
 public class _1062Test {
     private static _1062.Solution1 solution1;