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.
Example 1
Input
s = "00110110", k = 2Output
trueThe binary codes of length 2 are "00", "01", "10" and "11", and they can all be found as substrings at indices 0, 1, 3, and 2 respectively.
Example 2
Input
s = "0110", k = 1Output
trueThe binary codes of length 1 are "0" and "1", and both exist as substrings.
Constraints
- 1 <= s.length <= 5 * 10^5
- s[i] is either '0' or '1'.
- 1 <= k <= 20