Solution: K Empty Slots
Explore the K Empty Slots problem where bulbs are turned on day by day. Learn to find the earliest day two bulbs are on with exactly k bulbs off between by using an array and a min heap for efficient day comparisons, achieving optimal time and space complexity.
We'll cover the following...
We'll cover the following...
Statement
You are given bulbs arranged in a row, numbered from
Each day, exactly one bulb is switched on. You are given an array, bulbs of length