Stock span problem

This video explains the stock span problem in the simplest way possible. First i have explained the intuitive approach of solving using bruteforce in O(N2) time and then i have shown the intuition behind efficient approach and solved it using stack in just O(N) time. The CODE LINK for the efficient approach is given below. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)
CODE LINK: gist.github.co...

[@contactdi8426]

Bro, you literally must have spend a lot of time and efforts for sure because you explain such complex problems with ease ! that even experienced professional tutors aren't able to. Really appreciate your hardwork and contribution. Thanks buddy :)

[@vikalpjain1098]

I was finding the correct explanation from long time. My search ends here and you found a new subscriber. I will keep referring your video. Appreciate your effort you kept in this video, and thank you for helping me out! 🙂

[@abhijeetvdsh]

everyone was complicating it ... I found relief in your solution ... the code at side really helped to visualise !

[@aditya4707]

Thank you very sir.I was searching on youtube regarding this problem watched 2 other videos and stopped here. You made my understanding clear.

[@techdose4u]

Welcome :)

[@harshpatel1385]

sir, thank you very much from bottom of my heart. you are putting a lot of effort. your video helps me a lot.

[@techdose4u]

I am glad that students feel the way you do :) This is my motivation

[@KRajesh-ej7dy]

after seeing many vidoes i got good clarity in this thank you bro

[@techdose4u]

Welcome :)

[@PRUTHVIRAJRGEEB]

If anyone did not understand why the time was O(2N), it is because, for each element in the array, we at max do only 2 operations: 1. we push it to stack 2. We pop it from the stack. The whole algorithm just does this. So the worst case will be all the elements are pushed and also popped while running the algo. Hence O(2N)

[@karanroy-vr1wn]

yesterday night i read the book ....i didn't understand ...but after watching your video i got the clear cut idea ..

[@davidjonson303]

Best video for algo .. Thanks sir.😊

[@suvodeepsinha200]

This video explained the problem very well! Thanks a lot sir

[@techdose4u]

Welcome :)

[@anand__346]

awesome and mind blowing explanation bro , thank u very much 🔥🔥🔥

[@digitechtalks4167]

only this video gives me a clear approach!!

[@vibes.productive]

Thank your for your clear explanation sir....helped a lot!

[@techdose4u]

Welcome :)

[@soumensinha305]

Your Explanation technique is awesome. If possible please make more videos related to hashing,backtracking and Strings.

[@techdose4u]

Sure :)

[@vishekkumar8371]

Nice Explanation thanks for the efforts you put to make awsome videos that help lot of people :)

[@techdose4u]

Welcome 😊

[@GhostRider....]

Nice explanation sir

[@praveensisodia8055]

Truly appreciable... Very nicely explained. I have subscribed you. Thanks for this video.

[@techdose4u]

Welcome :)

[@kushalhu7189]

Great Explanation

[@balramchaudhary6449]

very informative video. Thanks a lot.

[@abhiram3275]

excellent approach sir.loved it

[@awakashsinha9926]

U teaches nice and u do a lot of efforts

[@techdose4u]

Yea it takes a lot of effort to make even a small video :) I am glad you all love it.

[@awakashsinha9926]

@@techdose4u I would suggest you to make dedicated videos on DP and graphs including medium level questions not just easy one to attract regular views and with easy or general questions u will not attract students for long but with dedicated videos students follows regularly

[@techdose4u]

Yes true. It's all about time. As soon as i get time, i make some videos. Will continue with graph soon. I was thinking the same as you suggested.

[@shreyajoshi5148]

U explain so well 😇

[@prasad.patil12]

It takes lots of efforts to make such videos and explain in simplest possible way This is priceless 👍

[@techdose4u]

Yea it does. Thanks :)

[@jagankumarpatra]

@@techdose4u same code is there in gfg article not more

[@ShivamSingh-me1nb]

Brilliant explanation

[@techdose4u]

Thanks :)

[@Legendary-Akshit]

Excellent explanation. Video highly recommended.

[@techdose4u]

Thanks :)

[@rahulchaubey8988]

Thanks for providing these vdos..

[@techdose4u]

Welcome :)

[@srajsekhar4061]

Nice explanation 👌👌👌 bro

[@techdose4u]

Thanks :)

[@diveshrajput572]

marvelous expalantoin sir,thanks a lot ....

[@techdose4u]

Welcome :)

[@sureshgarine]

nice explanation. how did u get a thought that stack is a better data structure for solving this problem? can anyone explain

[@ahmedmohammedshahid1007]

Amazing

[@davidjonson303]

Have you uploaded video on redundant bracket?..I am not getting it

[@MrDheeraj14]

Thanks Surya for your wonderful explanation! I have a quick question here. How the stack traversal is different brute force traversal? I guess both will take same time...isn't it? For example in brute force technique, we started at 6th Index and traversed all the way till first element. And we did the same thing in stack as well.

[@gandhijainamgunvantkumar6783]

here we are removing elements that are smaller than given index i, and after that we are pushing i in the stack, so if we go to next index and if arr[i+1]> arr[i], then we will be sure that the elements that we have removed in the previous step are less that arr[i+1], so we don't have traverse that elements again as they are already removed.

[@dmitrykarpenko2271]

Can you just use the previous calculations, like "if previous element is less than the current one, look to the left of the lower element's span"? This way you'll reuse the previous calculations and don't need the stack.

[@saisatyanarayanarawi2404]

Nice one yo

[@techdose4u]

Thanks

[@amirsalih4459]

What is the difference between this problem and online stock problem?

[@techdose4u]

All values are known already here. But online means you see an element at a time without knowing about future :)

[@aryan7069_]

Where u implemented queue and stack for competitive programming. Solution.... coz theres no queue stack in STL

[@priyankapardesiramachander871]

Thank you!

[@techdose4u]

Welcome

[@mohitdeo3648]

can your soln work for input:13,15,12,14,16,8,6,4,10,30

[@rahulshrivastava3040]

so poping element will not make the algo O(N2). I just do not know how come this is O(N)

[@techdose4u]

That's because an element can be popped only once. So max time for popping is also O(N).

[@rahulshrivastava3040]

@@techdose4u not quite right. you have a while loop which will keep popping till you see a larger element.

[@techdose4u]

While loop doesn't make the time complexity O(N2). The inner while loop will pop a maximum of N elements combining all the outer loops. Dry to dry run by using any example. You can go to 2N but not N^2.

[@akanshapanchal7107]

Thankyou so much, sir!!!

[@techdose4u]

Welcome :)

[@srilekha9177]

Hi. I don't understand the maximum profile sales wine problem (DP approach). can you make a video on it?

[@techdose4u]

Yea sure.....will make this week :) Thanks for suggesting. If you have a link then do share.

[@techdose4u]

Can you provide a link to the problem. I found wine selling with max profit using DP. Is this the one?

[@srilekha9177]

@@techdose4u Thank you. here is the link, www.geeksforgeeks.org/maximum-profit-sale-wines/

[@sahej97]

Hi great video! What software do you use?

[@thexhist3609]

openboard

[@BECSAQUIB]

Jazakallah khair

[@dheerajpoonia2175]

Thank you sir 🤗

[@techdose4u]

Welcome :)

[@Inndjkaawed2922]

Nearest greater integer to the left..that's the concept

[@RaushanKumar-co3wj]

awesome

[@techdose4u]

Thanks :)

[@lipishah474]

Thank you sir for such a nice explanation. I didn’t understand worst time complexity how it come out to be O(N). I believe that it’s O(N^2). Sir could you please help me with time complexity?

[@kapilkungwani8025]

Traversal of array is done one time, so time complexity is O(N)

[@Uzmasamreen29]

Plz give the code implementation also in c

[@prachisingh9868]

nice

[@techdose4u]

Thanks

[@yatri6329]

what will the Answer if [100,80,60,70,65,75,85]

[@GhostRider....]

1, 1, 1, 2, 1, 4, 6

[@shigo6350]

Thank you so much....

[@uttampandey1389]

vwery nicely ex[lained

[@techdose4u]

Thanks

[@gtbaba123]

Ty brother

[@karanroy-vr1wn]

sir, plz make video on dynamic programming ......as it is asked more in interview.....make a playlist of DP and upload 2-3 video daily....plz .....i have very less time to prepare for job.

[@techdose4u]

When is your interview?

[@karanroy-vr1wn]

@@techdose4u within 20 days

[@techdose4u]

I will keep uploading but the thing is that i make videos whenever i get time. I upload the important questions for interview itself. If you need any help for interview then let me know.

[@karanroy-vr1wn]

@@techdose4u ok ,sir

[@nikunjgupta2878]

Thanks sir

[@techdose4u]

Welcome :)

[@mohnishsinghbhamra]

before moving to next day i, you forget to tell the part of pushing back the popped elements from another stack till i-1 days.

[@techdose4u]

May have missed.....😅

[@harshpatel1385]

I want to donate for your channel.

[@techdose4u]

Consider your support as a donation :)

[@karanroy-vr1wn]

sir, plz make video on dynamic programming ......as it is asked more in interview.....make a playlist of DP and upload 2-3 video daily....plz .....i have very less time to prepare for job.

[@techdose4u]

When is your interview?

[@contactdi8426]

Have you paid me ? that he'll fully dedicate his time to upload 2-3 videos specifically on DP for you because your interview is coming? Morons -_-