_1461.java

packagecom.fishercoder.solutions.secondthousand;

importjava.util.HashSet;
importjava.util.Set;

publicclass_1461 {
publicstaticclassSolution1 {
/*
 * inspired by https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/discuss/660505/Java-4-lines-solution
 */
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;
 }
 }
}