Created 10-10-2024 POTD

This consists of solution to leetcode problem of the day - 10-10-2024
Gyanthakur · Oct 15, 2024 · bde91e2 · bde91e2
1 parent 4a83fac
commit bde91e2
Showing 1 changed file with 21 additions and 0 deletions.
diff --git a/october_2024/10-10-2024 b/october_2024/10-10-2024
@@ -0,0 +1,21 @@
+class Solution {
+public:
+    int maxWidthRamp(vector<int>& nums) 
+    {
+        int n = nums.size();
+        stack<int> st;
+        for(int i = 0; i < n; i++){
+            if(st.empty() || nums[st.top()] > nums[i]){
+                st.push(i);
+            }
+        }
+        int ans = 0;
+        for(int i = n-1; i > 0; i--){
+            while(!st.empty() && nums[st.top()] <= nums[i]){
+                ans = max(ans, i - st.top());
+                st.pop();
+            }
+        }
+        return ans;
+    }
+};