Maximum Difference | GeeksForGeeks | Problem of the Day

[@mathematics3398]

class Solution {
public:
vector left_smaller(vector &arr) {
vector ls(arr.size(), 0);
stack s;
for (unsigned int i = 0; i < arr.size(); i++) {
while (!s.empty() and s.top() >= arr[i])
s.pop();
if (!s.empty())
ls[i] = s.top();
else
ls[i] = 0;
s.push(arr[i]);
}
//print_arr(ls);
return ls;
}
void print_arr(vector arr) {
for (int i = 0; i < arr.size(); i++)
cout

[@mathematics3398]

Table of Contents
0:00 Problem Statement
2:27 Solution
8:16 Pseudo Code
11:12 Code