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.

A binary code of length k is any string consisting of exactly k characters, where each character is either '0' or '1'. For example, when k = 2, all possible binary codes are: "00", "01", "10", and "11".

You need to verify that all 2^k possible binary codes appear somewhere in s as contiguous substrings.