Sync LeetCode submission Runtime - 176 ms (57.84%), Memory - 19.6 MB (70.41%)

Author: jimit105

0683-k-empty-slots/README.md

@@ -0,0 +1,35 @@
+<p>You have <code>n</code> bulbs in a row numbered from <code>1</code> to <code>n</code>. Initially, all the bulbs are turned off. We turn on <strong>exactly one</strong> bulb every day until all bulbs are on after <code>n</code> days.</p>
+
+<p>You are given an array <code>bulbs</code>&nbsp;of length <code>n</code>&nbsp;where <code>bulbs[i] = x</code> means that on the <code>(i+1)<sup>th</sup></code> day, we will turn on the bulb at position <code>x</code>&nbsp;where&nbsp;<code>i</code>&nbsp;is&nbsp;<strong>0-indexed</strong>&nbsp;and&nbsp;<code>x</code>&nbsp;is&nbsp;<strong>1-indexed.</strong></p>
+
+<p>Given an integer <code>k</code>, return&nbsp;<em>the <strong>minimum day number</strong> such that there exists two <strong>turned on</strong> bulbs that have <strong>exactly</strong>&nbsp;<code>k</code> bulbs between them that are <strong>all turned off</strong>. If there isn&#39;t such day, return <code>-1</code>.</em></p>
+
+<p>&nbsp;</p>
+<p><strong class="example">Example 1:</strong></p>
+
+<pre>
+<strong>Input:</strong> bulbs = [1,3,2], k = 1
+<strong>Output:</strong> 2
+<b>Explanation:</b>
+On the first day: bulbs[0] = 1, first bulb is turned on: [1,0,0]
+On the second day: bulbs[1] = 3, third bulb is turned on: [1,0,1]
+On the third day: bulbs[2] = 2, second bulb is turned on: [1,1,1]
+We return 2 because on the second day, there were two on bulbs with one off bulb between them.</pre>
+
+<p><strong class="example">Example 2:</strong></p>
+
+<pre>
+<strong>Input:</strong> bulbs = [1,2,3], k = 1
+<strong>Output:</strong> -1
+</pre>
+
+<p>&nbsp;</p>
+<p><strong>Constraints:</strong></p>
+
+<ul>
+	<li><code>n == bulbs.length</code></li>
+	<li><code>1 &lt;= n &lt;= 2 * 10<sup>4</sup></code></li>
+	<li><code>1 &lt;= bulbs[i] &lt;= n</code></li>
+	<li><code>bulbs</code>&nbsp;is a permutation of numbers from&nbsp;<code>1</code>&nbsp;to&nbsp;<code>n</code>.</li>
+	<li><code>0 &lt;= k &lt;= 2 * 10<sup>4</sup></code></li>
+</ul>

0683-k-empty-slots/solution.py

@@ -0,0 +1,16 @@
+# Approach 1: Insert Into Sorted Structure
+
+import bisect
+
+class Solution:
+    def kEmptySlots(self, bulbs: List[int], k: int) -> int:
+        active = []
+
+        for day, bulb in enumerate(bulbs, 1):
+            i = bisect.bisect(active, bulb)
+            for neighbor in active[i - (i > 0) : i + 1]:
+                if abs(neighbor - bulb) - 1 == k:
+                    return day
+            active.insert(i, bulb)
+
+        return -1