Package g1401_1500.s1461_check_if_a_string_contains_all_binary_codes_of_size_k

Class Solution

java.lang.Object

g1401_1500.s1461_check_if_a_string_contains_all_binary_codes_of_size_k.Solution

public class Solution
extends Object

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

Medium

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 = 2

Output: true

Explanation: The binary codes of length 2 are “00”, “01”, “10” and “11”. They can be all found as substrings at indices 0, 1, 3 and 2 respectively.

Example 2:

Input: s = “0110”, k = 1

Output: true

Explanation: The binary codes of length 1 are “0” and “1”, it is clear that both exist as a substring.

Example 3:

Input: s = “0110”, k = 2

Output: false

Explanation: The binary code “00” is of length 2 and does not exist in the array.

Constraints:

• 1 <= s.length <= 5 * 105
• s[i] is either '0' or '1'.
• 1 <= k <= 20

Constructor Summary

Constructors

Constructor	Description
Solution()

Method Summary

Modifier and Type	Method	Description
boolean	hasAllCodes(String s, int k)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

Solution

public Solution()

Method Details

hasAllCodes

public boolean hasAllCodes(String s,
 int k)