Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Go

Solution: K Empty Slots

Explore how to determine the earliest day when two bulbs are on with exactly k bulbs off between them. Understand the use of a days array and a min heap to efficiently solve this problem with linear time complexity.

We'll cover the following...

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