Untitled
unknown
plain_text
a year ago
388 B
2
Indexable
Never
#include<stack> vector<int> nextSmallerElement(vector<int> &arr, int n) { stack<int> s; s.push(-1); vector<int> ans(n); for(int i=n-1; i>=0 ; i--) { int curr = arr[i]; while(s.top() >= curr) { s.pop(); } //ans is stack ka top ans[i] = s.top(); s.push(curr); } return ans; }