L15. Stock Span Problem | Stack and Queue Playlist

[@aparnaverma1562]

I was able to come up with solution by myself.
All thanks to you for making me improve my critical thinking

[@mrmehran879]

class StockSpanner {
public:
int index;
stack st;
StockSpanner() {
index =-1;
// st.clear();
}
int next(int price) {
index+=1;
int ans;
while(!st.empty() && st.top().first

[@Himanshugupta-bw9ht]

What a timing. I was solving this problem from SDE sheet and at first got disappointed as there was no link to this problem. I'm glad that I decided to checkout the channel. Unbeatable explanation like always. Thanks.

[@deepkodes4434]

liked it better when u gave the clear code at the end :)

[@iamnoob7593]

Brilliant explanation , Thank you

[@KalingaAbhisek]

Java Code
class StockSpanner {
Stack st = new Stack();
int ind;
public StockSpanner() {
st = new Stack();
ind = -1;
}
public int next(int price) {
ind++;
while(!st.isEmpty() && st.peek()[1]

[@kritangnasingh5934]

Great solution!

[@dayashankarlakhotia4943]

class StockSpanner {
Stackst;
public StockSpanner(){
st=new Stack();
}
public int next(int price){
int spam=1;
while(!st.isEmpty()&&st.peek ()[0]

[@showdownx8276]

Arre love you bhaiya ❤ i have done arrays, linked list, binary search, recursion ….. and was looking for stack n queue.
What a timing bhaiya ji 🥹 mauj kara di

[@abhishek_1510]

in 2nd approach space complexity should be O(2n) right ? (because we are using a stack of )

[@we_crood]

Able to solve Thanks :)

[@studystuff51]

won't space complexity also be O(2N) as we are storing both value and index in stack? Also I tried to do the question by myself, and here is my solution:
class StockSpanner {
public:
vector prices;
stack st;
StockSpanner() {
index = -1;
}

int next(int price) {
int ans;
prices.push_back(price);
while(!st.empty() && price >= prices[st.top()])
st.pop();
if(!st.empty()) ans = prices.size()-1-st.top();
else ans = prices.size();
st.push(prices.size()-1);
return ans;
}
};

[@Akash-Bisariya]

You are also using prices vector and stack here so space complexity will be O(2N) here also.

[@oyeshxrme]

thanks bhaiya

[@omkarshendge5438]

why do we need to reinitialize the index to -1 in the stockspanner() method guys? if we have declared it globally?

[@sanchitdeepsingh9663]

thanks

[@MJBZG]

understood

[@digantamondal2397]

suppose my input is
10 10 10 10
Sample Output 1:
1 1 1 1
then how can you handle it

[@praffulbisht8520]

I think sample output is wrong coz in condition it is stated that it will count for price less than or equal to current days.

[@charuprabha8714]

[@JohnSnow-r1e]

First view and comment

[@subhasrisb11tha28]

😁

[@atharvajagtap1233]

Java Code
class Pair {
I index;
V value;
public Pair(I key, V value) {
this.index = key;
this.value = value;
}
public I getIndex() {
return index;
}
public V getValue() {
return value;
}
}
public class StockSpanner {

Stack st;
int index;
public StockSpanner() {
this.st=new Stack();
this.index=-1;
}
public int next(int price) {
index++;
while(!st.empty()&&st.peek().value

[@nobody-kk8uh]

1st comment

[@abhinjr4918]

Please pin me
for 2 days❤

[@maverick_8707]

I'm waiting this for years ...thanks striver @takeUforward.... yesterday u said and u delivered

[@subee128]

Thanks