Search⌘ K
AI Features

Solution: K Empty Slots

Explore how to solve the K Empty Slots problem efficiently by tracking bulb activation days and using a min heap to identify the earliest day with two bulbs turned on that have exactly k off bulbs between them. Understand the use of a days array and window sliding technique to achieve a linear time solution.

Statement

You are given nn bulbs arranged in a row, numbered from 11 to nn. Initially, all bulbs are turned off.

Each day, exactly one bulb is switched on. You are given an array, bulbs of length ...