Search⌘ K
AI Features

Solution: K Empty Slots

Explore how to determine the earliest day when exactly k bulbs are off between two turned-on bulbs in a row. Learn to apply a min heap (monotonic queue) to track bulb activation days and efficiently identify valid pairs, improving your problem-solving skills for coding interviews.

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 ...