Solution: K Empty Slots
Understand how to determine the earliest day when two bulbs are turned on with exactly k bulbs off between them. Learn to apply a min heap data structure to efficiently track bulb activation days and analyze the problem using a transformed array of days for an optimal O(n) solution.
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