Class Solution
java.lang.Object
g1401_1500.s1461_check_if_a_string_contains_all_binary_codes_of_size_k.Solution
1461 - Check If a String Contains All Binary Codes of Size K.<p>Medium</p>
<p>Given a binary string <code>s</code> and an integer <code>k</code>, return <code>true</code> <em>if every binary code of length</em> <code>k</code> <em>is a substring of</em> <code>s</code>. Otherwise, return <code>false</code>.</p>
<p><strong>Example 1:</strong></p>
<p><strong>Input:</strong> s = “00110110”, k = 2</p>
<p><strong>Output:</strong> true</p>
<p><strong>Explanation:</strong> 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.</p>
<p><strong>Example 2:</strong></p>
<p><strong>Input:</strong> s = “0110”, k = 1</p>
<p><strong>Output:</strong> true</p>
<p><strong>Explanation:</strong> The binary codes of length 1 are “0” and “1”, it is clear that both exist as a substring.</p>
<p><strong>Example 3:</strong></p>
<p><strong>Input:</strong> s = “0110”, k = 2</p>
<p><strong>Output:</strong> false</p>
<p><strong>Explanation:</strong> The binary code “00” is of length 2 and does not exist in the array.</p>
<p><strong>Constraints:</strong></p>
<ul>
<li><code>1 <= s.length <= 5 * 10<sup>5</sup></code></li>
<li><code>s[i]</code> is either <code>'0'</code> or <code>'1'</code>.</li>
<li><code>1 <= k <= 20</code></li>
</ul>
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
Solution
public Solution()
-
-
Method Details
-
hasAllCodes
-