Add solution #962

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,046 LeetCode solutions in JavaScript
+# 1,047 LeetCode solutions in JavaScript
 
 [https://leetcode.com/](https://leetcode.com/)
 
@@ -770,6 +770,7 @@
 958|[Check Completeness of a Binary Tree](./solutions/0958-check-completeness-of-a-binary-tree.js)|Medium|
 959|[Regions Cut By Slashes](./solutions/0959-regions-cut-by-slashes.js)|Medium|
 960|[Delete Columns to Make Sorted III](./solutions/0960-delete-columns-to-make-sorted-iii.js)|Hard|
+962|[Maximum Width Ramp](./solutions/0962-maximum-width-ramp.js)|Medium|
 966|[Vowel Spellchecker](./solutions/0966-vowel-spellchecker.js)|Medium|
 970|[Powerful Integers](./solutions/0970-powerful-integers.js)|Easy|
 976|[Largest Perimeter Triangle](./solutions/0976-largest-perimeter-triangle.js)|Easy|

solutions/0962-maximum-width-ramp.js

@@ -0,0 +1,34 @@
+/**
+ * 962. Maximum Width Ramp
+ * https://leetcode.com/problems/maximum-width-ramp/
+ * Difficulty: Medium
+ *
+ * A ramp in an integer array nums is a pair (i, j) for which i < j and nums[i] <= nums[j].
+ * The width of such a ramp is j - i.
+ *
+ * Given an integer array nums, return the maximum width of a ramp in nums. If there is no
+ * ramp in nums, return 0.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var maxWidthRamp = function(nums) {
+  const stack = [];
+  let result = 0;
+
+  for (let i = 0; i < nums.length; i++) {
+    if (!stack.length || nums[stack.at(-1)] > nums[i]) {
+      stack.push(i);
+    }
+  }
+
+  for (let j = nums.length - 1; j >= 0; j--) {
+    while (stack.length && nums[stack.at(-1)] <= nums[j]) {
+      result = Math.max(result, j - stack.pop());
+    }
+  }
+
+  return result;
+};