On the first day: bulbs = 1, first bulb is turned on: Given an integer K, find out the minimum day number such that there exists two turned on bulbs that have exactly K bulbs between them that are all turned off. You are given an array bulbs of length N where bulbs = x means that on the (i+1)th day, we will turn on the bulb at position x where i is 0-indexed and x is 1-indexed.
We turn on exactly one bulb everyday until all bulbs are on after N days. You have N bulbs in a row numbered from 1 to N.
