Tap here to switch tabs
Problem
Submissions

Problem: K Empty Slots

K Empty Slots gives the order bulbs turn on in a row and asks for the earliest day when two lit bulbs have exactly k unlit bulbs between them, or -1 if none exists.

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 nn where bulbs[i] =x= x means that on day i + 1i + 1 (1‑indexed), the bulb at position xx (also 1‑indexed) is turned on.

So, given an integer k, determine the earliest day (the smallest day number) on which there are two bulbs that are on such that exactly k bulbs are off between them.

If no such day exists, return −1-1.

Constraints:

  • n==n == bulbs.length

  • 1≤n≤1031 \leq n \leq 10^3

  • 1≤1 \leq bulbs[i] ≤n\leq n

  • bulbs is a permutationIt is a sequence that contains every integer from 1 to n exactly once and in any order. of numbers from 11 to nn

  • 0≤0 \leq k ≤103\leq 10^3

⋮
Tap here to switch tabs
Problem
Submissions

Problem: K Empty Slots

K Empty Slots gives the order bulbs turn on in a row and asks for the earliest day when two lit bulbs have exactly k unlit bulbs between them, or -1 if none exists.

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 nn where bulbs[i] =x= x means that on day i + 1i + 1 (1‑indexed), the bulb at position xx (also 1‑indexed) is turned on.

So, given an integer k, determine the earliest day (the smallest day number) on which there are two bulbs that are on such that exactly k bulbs are off between them.

If no such day exists, return −1-1.

Constraints:

  • n==n == bulbs.length

  • 1≤n≤1031 \leq n \leq 10^3

  • 1≤1 \leq bulbs[i] ≤n\leq n

  • bulbs is a permutationIt is a sequence that contains every integer from 1 to n exactly once and in any order. of numbers from 11 to nn

  • 0≤0 \leq k ≤103\leq 10^3