Given a binary string s and an integer k, return true if every binary code of length k is a substring of s, or false otherwise.

Constraints:

• $1 \leq$ s.length $\leq 5 imes 10^5$

• s[i] is either '0' or '1'

• $1 \leq$ k $\leq 20$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.