Leetcode 2904. Shortest and Lexicographically Smallest Beautiful String

Given a binary string s and integer k, find the shortest substring that contains exactly k '1's and return the lexicographically smallest such substring (or empty if none). This can be solved by examining windows spanning k consecutive '1's and choosing the minimum-length window with lexicographic tie-breaking.