add 1100

Author: fishercoder1534

README.md

@@ -88,6 +88,7 @@ _If you like this project, please leave me a star._ ★
 |1108|[Defanging an IP Address](https://leetcode.com/problems/defanging-an-ip-address/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1108.java) |  [:tv:](https://www.youtube.com/watch?v=FP0Na-pL0qk)|Easy||
 |1104|[Path In Zigzag Labelled Binary Tree](https://leetcode.com/problems/path-in-zigzag-labelled-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1104.java) | |Medium|Math, Tree|
 |1103|[Distribute Candies to People](https://leetcode.com/problems/distribute-candies-to-people/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1103.java) | |Easy|Math|
+|1100|[Find K-Length Substrings With No Repeated Characters](https://leetcode.com/problems/find-k-length-substrings-with-no-repeated-characters/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1100.java) | |Medium|String, Sliding Window|
 |1099|[Two Sum Less Than K](https://leetcode.com/problems/two-sum-less-than-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1099.java) |  [:tv:](https://www.youtube.com/watch?v=2Uq7p7HE0TI)|Easy||
 |1089|[Duplicate Zeros](https://leetcode.com/problems/duplicate-zeros/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1089.java) | |Easy||
 |1086|[High Five](https://leetcode.com/problems/high-five/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1086.java) | [:tv:](https://www.youtube.com/watch?v=3iqC5J4l0Cc)|Easy||

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

@@ -0,0 +1,48 @@
+package com.fishercoder.solutions;
+
+import java.util.HashSet;
+import java.util.Set;
+
+/**
+ * 1100. Find K-Length Substrings With No Repeated Characters
+ *
+ * Given a string S, return the number of substrings of length K with no repeated characters.
+ *
+ * Example 1:
+ * Input: S = "havefunonleetcode", K = 5
+ * Output: 6
+ * Explanation:
+ * There are 6 substrings they are : 'havef','avefu','vefun','efuno','etcod','tcode'.
+ *
+ * Example 2:
+ * Input: S = "home", K = 5
+ * Output: 0
+ * Explanation:
+ * Notice K can be larger than the length of S. In this case is not possible to find any substring.
+ *
+ * Note:
+ * 1 <= S.length <= 10^4
+ * All characters of S are lowercase English letters.
+ * 1 <= K <= 10^4
+ * */
+public class _1100 {
+    public static class Solution1 {
+        public int numKLenSubstrNoRepeats(String S, int K) {
+            int count = 0;
+            Set<Character> set = new HashSet<>();
+            for (int i = 0; i <= S.length() - K; i++) {
+                String string = S.substring(i, i+K);
+                boolean invalid = false;
+                for (char c : string.toCharArray()) {
+                    if (!set.add(c)) {
+                        invalid = true;
+                        break;
+                    }
+                }
+                count += invalid ? 0 : 1;
+                set.clear();
+            }
+            return count;
+        }
+    }
+}

src/test/java/com/fishercoder/_1100Test.java

@@ -0,0 +1,26 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1100;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1100Test {
+    private static _1100.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1100.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(6, solution1.numKLenSubstrNoRepeats("havefunonleetcode", 5));
+    }
+
+    @Test
+    public void test2() {
+        assertEquals(0, solution1.numKLenSubstrNoRepeats("home", 5));
+    }
+}