### Sliding Window Technique - Part 2

Crossing the 650 problems solved milestone today (weekends in covid-filled era are great for practicing algorithms) Here is the 650th problem: https://leetcode.com/problems/check-if-a-string-contains-all-binary-codes-of-size-k/ 1461. Check If a String Contains All Binary Codes of Size K Medium 34 20 Add to List Share Given a binary string s and an integer k . Return True if any 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 = "011