Add solution #2336

Author: JoshCrozier

README.md

@@ -512,6 +512,7 @@
 2215|[Find the Difference of Two Arrays](./2215-find-the-difference-of-two-arrays.js)|Easy|
 2235|[Add Two Integers](./2235-add-two-integers.js)|Easy|
 2244|[Minimum Rounds to Complete All Tasks](./2244-minimum-rounds-to-complete-all-tasks.js)|Medium|
+2336|[Smallest Number in Infinite Set](./2336-smallest-number-in-infinite-set.js)|Medium|
 2352|[Equal Row and Column Pairs](./2352-equal-row-and-column-pairs.js)|Medium|
 2390|[Removing Stars From a String](./2390-removing-stars-from-a-string.js)|Medium|
 2396|[Strictly Palindromic Number](./2396-strictly-palindromic-number.js)|Medium|

solutions/2336-smallest-number-in-infinite-set.js

@@ -0,0 +1,36 @@
+/**
+ * 2336. Smallest Number in Infinite Set
+ * https://leetcode.com/problems/smallest-number-in-infinite-set/
+ * Difficulty: Medium
+ *
+ * You have a set which contains all positive integers [1, 2, 3, 4, 5, ...].
+ *
+ * Implement the SmallestInfiniteSet class:
+ * - SmallestInfiniteSet() Initializes the SmallestInfiniteSet object to contain all
+ *   positive integers.
+ * - int popSmallest() Removes and returns the smallest integer contained in the
+ *   infinite set.
+ * - void addBack(int num) Adds a positive integer num back into the infinite set,
+ *   if it is not already in the infinite set.
+ */
+
+var SmallestInfiniteSet = function() {
+  this.set = new Array(1000).fill(1);
+};
+
+/**
+ * @return {number}
+ */
+SmallestInfiniteSet.prototype.popSmallest = function() {
+  const num = this.set.findIndex(n => n);
+  this.set[num] = 0;
+  return num + 1;
+};
+
+/**
+ * @param {number} num
+ * @return {void}
+ */
+SmallestInfiniteSet.prototype.addBack = function(num) {
+  this.set[num - 1] = 1;
+};