Add solution #1441

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,304 LeetCode solutions in JavaScript
+# 1,305 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1099,6 +1099,7 @@
 1437|[Check If All 1's Are at Least Length K Places Away](./solutions/1437-check-if-all-1s-are-at-least-length-k-places-away.js)|Easy|
 1438|[Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit](./solutions/1438-longest-continuous-subarray-with-absolute-diff-less-than-or-equal-to-limit.js)|Medium|
 1439|[Find the Kth Smallest Sum of a Matrix With Sorted Rows](./solutions/1439-find-the-kth-smallest-sum-of-a-matrix-with-sorted-rows.js)|Hard|
+1441|[Build an Array With Stack Operations](./solutions/1441-build-an-array-with-stack-operations.js)|Medium|
 1443|[Minimum Time to Collect All Apples in a Tree](./solutions/1443-minimum-time-to-collect-all-apples-in-a-tree.js)|Medium|
 1446|[Consecutive Characters](./solutions/1446-consecutive-characters.js)|Easy|
 1447|[Simplified Fractions](./solutions/1447-simplified-fractions.js)|Medium|

solutions/1441-build-an-array-with-stack-operations.js

@@ -0,0 +1,46 @@
+/**
+ * 1441. Build an Array With Stack Operations
+ * https://leetcode.com/problems/build-an-array-with-stack-operations/
+ * Difficulty: Medium
+ *
+ * You are given an integer array target and an integer n.
+ *
+ * You have an empty stack with the two following operations:
+ * - "Push": pushes an integer to the top of the stack.
+ * - "Pop": removes the integer on the top of the stack.
+ *
+ * You also have a stream of the integers in the range [1, n].
+ *
+ * Use the two stack operations to make the numbers in the stack (from the bottom to the top) equal
+ * to target. You should follow the following rules:
+ * - If the stream of the integers is not empty, pick the next integer from the stream and push it
+ *   to the top of the stack.
+ * - If the stack is not empty, pop the integer at the top of the stack.
+ * - If, at any moment, the elements in the stack (from the bottom to the top) are equal to target,
+ *   do not read new integers from the stream and do not do more operations on the stack.
+ *
+ * Return the stack operations needed to build target following the mentioned rules. If there are
+ * multiple valid answers, return any of them.
+ */
+
+/**
+ * @param {number[]} target
+ * @param {number} n
+ * @return {string[]}
+ */
+var buildArray = function(target, n) {
+  const result = [];
+  let current = 1;
+
+  for (const num of target) {
+    while (current < num) {
+      result.push('Push');
+      result.push('Pop');
+      current++;
+    }
+    result.push('Push');
+    current++;
+  }
+
+  return result;
+};