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/

 

class Solution:
    def hashAllCodes(self, s: str, k: int) -> bool:
        codeSet = set()

        for i in range(len(s) -k + 1):
            codeSet.add(s[i:i + k])
        return len(codeSet) == 2 ** k

A naive approach would be to iterate over the string for each given binary combination.

But instead, we can use a set to check whether the number of consecutive substrings of length k is equal to the number of binary combinations of length k.