add 1461

fishercoder1534 · fishercoder1534 · commit 8b7d3b4dc309 · 2021-03-12T07:40:37.000-08:00
diff --git a/README.md b/README.md
@@ -145,6 +145,7 @@ _If you like this project, please leave me a star._ &#9733;
 |1469|[Find All The Lonely Nodes](https://leetcode.com/problems/find-all-the-lonely-nodes/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1469.java) | |Easy|Tree, DFS|
 |1466|[Reorder Routes to Make All Paths Lead to the City Zero](https://leetcode.com/problems/reorder-routes-to-make-all-paths-lead-to-the-city-zero/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1466.java) | |Medium|Tree, DFS|
 |1464|[Maximum Product of Two Elements in an Array](https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1464.java) | |Easy|Array|
+|1461|[Check If a String Contains All Binary Codes of Size K](https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1461.java) | |Medium|String, Bit Manipulation|
 |1460|[Make Two Arrays Equal by Reversing Sub-arrays](https://leetcode.com/problems/make-two-arrays-equal-by-reversing-sub-arrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1460.java) | |Easy|Array|
 |1457|[Pseudo-Palindromic Paths in a Binary Tree](https://leetcode.com/problems/pseudo-palindromic-paths-in-a-binary-tree/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1457.java) | |Medium|Bit Manipulation, Tree, DFS|
 |1456|[Maximum Number of Vowels in a Substring of Given Length](https://leetcode.com/problems/maximum-number-of-vowels-in-a-substring-of-given-length/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1456.java) | |Medium|String, Sliding Window|
diff --git a/src/main/java/com/fishercoder/solutions/_1461.java b/src/main/java/com/fishercoder/solutions/_1461.java
@@ -0,0 +1,16 @@
+package com.fishercoder.solutions;
+
+import java.util.HashSet;
+import java.util.Set;
+
+public class _1461 {
+    public static class Solution1 {
+        public boolean hasAllCodes(String s, int k) {
+            Set<String> set = new HashSet<>();
+            for (int i = 0; i <= s.length() - k; i++) {
+                set.add(s.substring(i, i + k));
+            }
+            return set.size() == 1 << k;
+        }
+    }
+}
diff --git a/src/test/java/com/fishercoder/_1461Test.java b/src/test/java/com/fishercoder/_1461Test.java
@@ -0,0 +1,22 @@
+package com.fishercoder;
+
+import com.fishercoder.solutions._1461;
+import org.junit.BeforeClass;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class _1461Test {
+    private static _1461.Solution1 solution1;
+
+    @BeforeClass
+    public static void setup() {
+        solution1 = new _1461.Solution1();
+    }
+
+    @Test
+    public void test1() {
+        assertEquals(true, solution1.hasAllCodes("00110110", 2));
+    }
+
+}
