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

preview_player
Показать описание
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 indicies 0, 1, 3 and 2 respectively.
Example 2:

Input: s = "00110", k = 2
Output: true
Example 3:

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 4:

Input: s = "0110", k = 2
Output: false
Explanation: The binary code "00" is of length 2 and doesn't exist in the array.
Example 5:

Input: s = "0000000001011100", k = 4
Output: false

Рекомендации по теме
Комментарии
Автор

Tq so much ma'am v useful for me👍👍

reshmaparveen
Автор

time is not O(n)..it is O(n-K+1)(k)....since k is less than 20, it is o(n) for this question

bharathkumar
Автор

Hello, I have this question how do you come up with the solution?
Is it on your own or you as well do look up other resources?

therealsumitshah
Автор

your explanation was very good....but plz improve your background noise:)

shahrukhhussain
Автор

Nice explaination
videos of yesterday and day bfr yesterday?

vinaykenguva