Leetcode 1016. Binary String With Substrings Representing 1 To N

Determine whether every integer from 1 to n has its binary representation appearing as a contiguous substring of s; since n can be much larger than |s|, the key insight is that only numbers with binary length ≤ |s| can appear, so you must efficiently verify presence of those patterns.