1461. Check If a String Contains All Binary Codes of Size K

Given a binary string s and an integer k.

Return True if every binary code of length k is a substring of s. Otherwise, return False.

class Solution {
public:
    bool hasAllCodes(string s, int k) {
        int binary = 0;
        int bitwiseAND = (1<<k) - 1;
        for(int i = 0; i < k; binary = ((binary << 1) | (s[i++] & 0b1111)));
        unordered_set<int> binarySet {binary};
        for(int i = k; i <= s.length(); binary = ((binary<<1) & bitwiseAND) | (s[i++] & 0b1111)) {
            binarySet.insert(binary);
        }

        return binarySet.size() == bitwiseAND + 1;
    }
};