Add solution #2375

Author: JoshCrozier

2375-construct-smallest-number-from-di-string.js

@@ -0,0 +1,34 @@
+/**
+ * 2375. Construct Smallest Number From DI String
+ * https://leetcode.com/problems/construct-smallest-number-from-di-string/
+ * Difficulty: Medium
+ *
+ * You are given a 0-indexed string pattern of length n consisting of the characters
+ * 'I' meaning increasing and 'D' meaning decreasing.
+ *
+ * A 0-indexed string num of length n + 1 is created using the following conditions:
+ * - num consists of the digits '1' to '9', where each digit is used at most once.
+ * - If pattern[i] == 'I', then num[i] < num[i + 1].
+ * - If pattern[i] == 'D', then num[i] > num[i + 1].
+ *
+ * Return the lexicographically smallest possible string num that meets the conditions.
+ */
+
+/**
+ * @param {string} pattern
+ * @return {string}
+ */
+var smallestNumber = function(pattern) {
+  let result = '';
+
+  for (let i = 0, stack = []; i <= pattern.length; i++) {
+    stack.push(i + 1);
+    if (i === pattern.length || pattern[i] === 'I') {
+      while (stack.length > 0) {
+        result += stack.pop();
+      }
+    }
+  }
+
+  return result;
+};

README.md

@@ -553,6 +553,7 @@
 2349|[Design a Number Container System](./2349-design-a-number-container-system.js)|Medium|
 2352|[Equal Row and Column Pairs](./2352-equal-row-and-column-pairs.js)|Medium|
 2364|[Count Number of Bad Pairs](./2364-count-number-of-bad-pairs.js)|Medium|
+2375|[Construct Smallest Number From DI String](./2375-construct-smallest-number-from-di-string.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|
 2413|[Smallest Even Multiple](./2413-smallest-even-multiple.js)|Easy|