Solution: K Empty Slots

Explore how to determine the earliest day two bulbs are on with exactly k bulbs off between them by transforming the problem using day-based indexing and a min heap. Understand how to maintain a sliding window of bulbs and efficiently check conditions to identify the earliest valid day using an O(n) time complexity approach.