|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|

packagecom.fishercoder.solutions;

importjava.util.HashSet;

importjava.util.Set;

publicclass_1461 {

publicstaticclassSolution1 {

publicbooleanhasAllCodes(Strings,intk) {

Set<String>set =newHashSet<>();

for (inti =0;i <=s.length() -k;i++) {

set.add(s.substring(i,i +k));

}

returnset.size() ==1 <<k;

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1461;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1461Test {

privatestatic_1461.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1461.Solution1();

}

publicvoidtest1() {

assertEquals(true,solution1.hasAllCodes("00110110",2));

}

}