Add solution #2289

JoshCrozier · JoshCrozier · commit 89f859e5c07f · 2025-07-28T23:42:30.000-05:00
diff --git a/README.md b/README.md
@@ -2079,6 +2079,7 @@
 2286|[Booking Concert Tickets in Groups](./solutions/2286-booking-concert-tickets-in-groups.js)|Hard|
 2287|[Rearrange Characters to Make Target String](./solutions/2287-rearrange-characters-to-make-target-string.js)|Easy|
 2288|[Apply Discount to Prices](./solutions/2288-apply-discount-to-prices.js)|Medium|
+2289|[Steps to Make Array Non-decreasing](./solutions/2289-steps-to-make-array-non-decreasing.js)|Medium|
 2291|[Maximum Profit From Trading Stocks](./solutions/2291-maximum-profit-from-trading-stocks.js)|Medium|
 2293|[Min Max Game](./solutions/2293-min-max-game.js)|Easy|
 2294|[Partition Array Such That Maximum Difference Is K](./solutions/2294-partition-array-such-that-maximum-difference-is-k.js)|Medium|
diff --git a/solutions/2289-steps-to-make-array-non-decreasing.js b/solutions/2289-steps-to-make-array-non-decreasing.js
@@ -0,0 +1,32 @@
+/**
+ * 2289. Steps to Make Array Non-decreasing
+ * https://leetcode.com/problems/steps-to-make-array-non-decreasing/
+ * Difficulty: Medium
+ *
+ * You are given a 0-indexed integer array nums. In one step, remove all elements nums[i]
+ * where nums[i - 1] > nums[i] for all 0 < i < nums.length.
+ *
+ * Return the number of steps performed until nums becomes a non-decreasing array.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var totalSteps = function(nums) {
+  const n = nums.length;
+  const stack = [];
+  const steps = new Array(n).fill(0);
+  let result = 0;
+
+  for (let i = n - 1; i >= 0; i--) {
+    while (stack.length && nums[i] > nums[stack[stack.length - 1]]) {
+      const j = stack.pop();
+      steps[i] = Math.max(steps[i] + 1, steps[j]);
+    }
+    result = Math.max(result, steps[i]);
+    stack.push(i);
+  }
+
+  return result;
+};
