Optimize solution for "Check If a String Contains All Binary Codes of Size K" problem by early exit when all substrings are found

Author: dkoval

src/main/java/com/github/dkoval/leetcode/challenge/CheckIfStringContainsAllBinaryCodesOfSizeK.java

@@ -86,10 +86,12 @@ public boolean hasAllCodes(String s, int k) {
             final var substrs = new HashSet<>();
             for (var start = 0; start <= n - k; start++) {
                 substrs.add(s.substring(start, start + k));
+                // the total number of such substrings must be 2^k
+                if (substrs.size() == (1 << k)) {
+                    return true;
+                }
             }
-
-            // the total number of such substrings should be 2^k
-            return substrs.size() == (1 << k);
+            return false;
         }
     }