Add solution #1656

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,454 LeetCode solutions in JavaScript
+# 1,455 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1276,6 +1276,7 @@
 1653|[Minimum Deletions to Make String Balanced](./solutions/1653-minimum-deletions-to-make-string-balanced.js)|Medium|
 1654|[Minimum Jumps to Reach Home](./solutions/1654-minimum-jumps-to-reach-home.js)|Medium|
 1655|[Distribute Repeating Integers](./solutions/1655-distribute-repeating-integers.js)|Hard|
+1656|[Design an Ordered Stream](./solutions/1656-design-an-ordered-stream.js)|Easy|
 1657|[Determine if Two Strings Are Close](./solutions/1657-determine-if-two-strings-are-close.js)|Medium|
 1668|[Maximum Repeating Substring](./solutions/1668-maximum-repeating-substring.js)|Easy|
 1669|[Merge In Between Linked Lists](./solutions/1669-merge-in-between-linked-lists.js)|Medium|

solutions/1656-design-an-ordered-stream.js

@@ -0,0 +1,46 @@
+/**
+ * 1656. Design an Ordered Stream
+ * https://leetcode.com/problems/design-an-ordered-stream/
+ * Difficulty: Easy
+ *
+ * There is a stream of n (idKey, value) pairs arriving in an arbitrary order, where idKey is
+ * an integer between 1 and n and value is a string. No two pairs have the same id.
+ *
+ * Design a stream that returns the values in increasing order of their IDs by returning a chunk
+ * (list) of values after each insertion. The concatenation of all the chunks should result in a
+ * list of the sorted values.
+ *
+ * Implement the OrderedStream class:
+ * - OrderedStream(int n) Constructs the stream to take n values.
+ * - String[] insert(int idKey, String value) Inserts the pair (idKey, value) into the stream,
+ *   then returns the largest possible chunk of currently inserted values that appear next in
+ *   the order.
+ */
+
+/**
+ * @param {number} n
+ */
+var OrderedStream = function(n) {
+  this.stream = new Array(n).fill(null);
+  this.nextIndex = 0;
+};
+
+/**
+ * @param {number} idKey
+ * @param {string} value
+ * @return {string[]}
+ */
+OrderedStream.prototype.insert = function(idKey, value) {
+  const index = idKey - 1;
+  this.stream[index] = value;
+
+  if (index !== this.nextIndex) return [];
+
+  const result = [];
+  while (this.nextIndex < this.stream.length && this.stream[this.nextIndex] !== null) {
+    result.push(this.stream[this.nextIndex]);
+    this.nextIndex++;
+  }
+
+  return result;
+};