6 Stock Span Problem

[@jagrit07]

Thanks, man. @Aditya Verma Anyone who just watched the video for 5 minutes and they got the solution on their own should still like the video because He did hard work explaining it. And because of his previous videos, we were able to solve it.

[@TheAdityaVerma]

Thanks brother, Do subscribe and share, that keeps me motivated to do more !!

[@KeshavSingh-si4vm]

@@TheAdityaVerma I am at NIT Surathkal and currently preparing for internship interviews . You DP videos are helping me a lot .

[@mohsinabbassayyed9610]

@@TheAdityaVerma what if the given array is [100 86 78 89 1000]

[@chillguyy.99]

true

[@mayankverma8989]

@@mohsinabbassayyed9610 ngl of 1000 will be -1 and index of 1000 is 4 so if u do ngl index-i that is 4-(-1)=5 will be the answer

[@Kirti-bi2yj]

A more optimized solution, rather than storing pair in the stack, we can just solely store the NGL index itself, that will also work : vector calculateSpan(int price[], int n) { vector ans; stack s; for(int i=0; i

[@aub1729]

dangg that's good!

[@tarandeepsingh4291]

you don't need that separate loop for populating ans vector, you can do it on the go: vector calculateSpan(vector& v) { // write code here int n = v.size(); stack st; vector ans(n,-1); for(int i = 0;i

[@AP-bk8vq]

Amazing work.. even paid courses don't have explanations anywhere near this level..Please make videos on Graph too!

[@nishant5249]

@@niru1931 agree

[@raheman5913]

@@niru1931 acha nahi hai kya bhai coding ninja

[@AdilofiMelody]

@@raheman5913 free hai???

[@relaxcoder8228]

@@AdilofiMelody agree

[@democratcobra]

100000 % agree.

[@shivangirastogi1539]

This is my first ever comment on you tube and without a single doubt your teaching skills make me do that. Great Work Man ☺️ Eagerly waiting for new playlists..

[@TheAdityaVerma]

Thanks! 😅✌️

[@divyanshusaxena148]

i bet IITians are watching videos of this NIT guy. Good going man.

[@shades1799]

Me : IIT kgp 😂

[@KingAkash.01]

Me IIT:not selected

[@jatin_goyal]

Me : Amity university

[@imPriyansh77]

Me : IIT Delhi

[@Sm_iitp]

Me . iitpatna

[@nikhil6842]

I saw the explanation of this question in a very famous paid course. However they still failed to mention the intuition of arriving at this solution using stack, loved how you broke it into the NGL problem and the overall intuition behind it

[@suyashdubey520]

Watching this again for nostalgia's sake.

[@TheAdityaVerma]

😂😂😂😂

[@mvabhinav1998]

Awesome series. I was able to it myself 😃 I wish he made videos for rest of the topics as well. He is an amazing teacher !! Thankyou aditya

[@dashrathsinghkaviya]

Bhaiya aap na main last year main hu tier 3 clg mein and maine dsa start kr rkhi h to stacks search kia to aapki videos mili...and aap manoge nhi mera concept itna awsm bn rha h na stacks mein ki kya hi btau...schi mein kafi shi pdhate ho aap... great job...keep it up... I've subscribed too... Thanks for making my concepts clear... FROM JAIPUR

[@ahishnar1568]

Got the solution at 2:59 only, that how we can solve this. Great great great great great coding, programming, problem solving master. The only person who made not only dp but entire programming and problem solving easy. The guy who made entire programming and problem solving easy. Hats off to you bro. 🤘🤘🤘😀☺️🎉🎉🎉🙏🙏🙏🙏🙏🙏

[@coding_bro4158]

i have not seen any playlist of this channel other than this stack playlist......but i must say, its killing it. My stack understanding and problem solving has improved a lot , every other channel like anuj bhaiya , love baber , khuswaha has not explained as clear as him. Thank u @Aditya Verma Bhaiya😇

[@tarangranpara5913]

the way you connected with NGL problem, hats off brother. you're an inspiration.

[@rishabhgupta734]

just commenting to remind you that even after 1 year this video is helping many people like me. KUDOS to you.

[@Ayush-bk3rv]

The first Four Foundation problem was a neat trick before getting to this problem, you made the viewer use his intuition to get to the solution.

[@vineetswami376]

Almost three year passes, but no one can make better content then you, you are such a genious.

[@Gauravkumar-kc6xh]

Wanted all dsa by you bro. You just rock the dsa.

[@coldfinger3472]

There may be many better programmer than you, but I have not seen better teacher than you for sure. The way you teach in flow is soo dope. thank you so much.

[@milimishra6447]

first time someone explained like this............great content..thanksssssssssssssss alot..u r amazingggggggggggggggggggggggggggggggg..

[@dochimekashiariri7610]

I found one more thing in my life to be thankful for 🥺.

[@ay-tw4om]

there is a leetcode editorial for this question which has O(1) amortized time complexity. Running a for loop for each call to next() is not needed. The key idea behind this approach is that the "answer" for a previous "price" can be directly added to the current answer, if current price is greater.

[@priyanshigupta1359]

apko kaise thanks bolo bhaiya ...aap itna acha padhate ho mujhse stack ke ques solve hone lge...thanks bhaiya

[@YashHalgaonkar]

Just watched the explanation of the question. Got the intuition and solved it on my own in less than 5 min. Amazing work @AdityaVerma!!

[@bhavyamalviya8364]

Thanks for taking time out from your schedule and sharing the knowledge with all of us

[@ASHISHSINGH-gs3yt]

Slight optimisation for time complexity Just store the index of the elements in the array and code as following : stack s; for(int i=0; i

[@nadeem2944]

without using a pair in stack : #include vector findSpans(vector &price) { stack s ; int n = price.size() ; vector ans(n) ; for(int i = 0 ; i < n ; i++ ) { int curr = price[i] ; while( !s.empty() && price[s.top()]

[@danishakhtar2683]

Man you are good the way teach you is just incredible,subscribed and share done . I already recommended your DP playlist to my juniors !! LOVE FROM NITW!!

[@neerajmahapatra5239]

I just imagined the explanation just by hearing the problem statement hats off to you ..

[@ankursharma6084]

Sucha a unique and beautiful way of teaching. You are really an awesome tutor. Yesterday i watched Coding Blocks video and today after watching your video i know that you are in a complete different level. And that also we get your outstanding content and experience for free. This is so thankful of you.

[@b82tushar22]

Kya beta, mjaa aa rha hai na!

[@criminalcoder6307]

I'm a fresher and I completed all the data structures playlist . Thanks

[@PritamKumar-mr5dv]

yes bhaiya zindagi me kohi batayga must phadtey ho app....huge support bhaiya.....

[@bismeetsingh352]

Python Code: i=0 while i0 and stack[-1][1]0: difference=i-stack[-1][0] ans.append(difference) else: ans.append(i+1) stack.append((i,arr[i])) i+=1 print(ans)

[@suvam2perfect]

If I got your series 3 years back perhaps I might not waste my b.tech years 🙌

[@AnkushKumar-mk8ns]

Might...

[@abhishekrattu]

The best person who is teaching in the BEST way! Very Very Helpful content :)

[@tusharjangid2492]

Great work man, was really helpful. One can see depth of your grasp on what you teach.

[@LokeshSharmaCP]

great bhai sach me zabardast... the flow.....😎

[@parvahuja7618]

sir you are really the best teacher out there

[@deveshsingh7257]

rather than storing values in stack we can store index ,therefore ,we don't need pair

[@bhargavi3681]

Thank you so much for creating this videos. I have written the whole code by understanding the theory and with the help of previous videos. Great work sir. Thank you.🙏

[@Reels-fact-7]

thank you so much for easy explanation

[@divya5808]

Hattsss off to you sir!! You are just remarkable and phenomenon!! Please do post more videos like this,so that we can learn more from you!Thanks alot!

[@deepakjnvx]

I dont think that there is any need of stack of pair, we can solve the question by just using stack of int as following.... vector calculateSpan(int price[], int n){ vector ans; stack st; for(int i=0;i

[@abhishek2116]

explain in very simple manner , thanks sir, now i am able to move standard/tough or tricky method

[@Chiragpanchal000]

Thanks a lot for this series Aditya. Just trying to optimize this further, we can also do this without 2nd for loop . const stockSpan = (arr: number[]): number[] => { const result: number[] = []; const stack = []; for (let i = 0; i < arr.length; i++) { if (stack.length > 0 && stack[stack.length - 1]?.value

[@sumitsaurabh8943]

Heartly, First time I subscribed and liked any playlist on youtuve . Really your explanation is intresting .thanks

[@vikaskumarnitrr]

i have been watching your videos for quite sometime now,and i am able to solve/code just by watching your explanation thanks bhaiya and your identification techniques is just mind blowing

[@GauravKumar-dw2ml]

I solved this question without using pair. As we can do price[s.top()] .Thanks @Aditya for such a strong foundation.

[@techlover714]

Border problems aside. But you Indians are exceptional programmers. Love Aditya Verma from Pakistan.

[@RathourShubham]

No offence, but I have some questions. Why are you here? Do you even have codings there?

[@techlover714]

@@RathourShubhamunlike India, only rapes are not present in Pakistan. But otherwise we have many things in common.

[@skritichauhan]

your explainations are really amazing. Please make videos on bit manipulation questions too. With your explanations, students can easily master this topic as well

[@shrutijain2426]

Thanks @Aditya Verma. Your way of teaching is hands down the best. Even professors cannot teach in this way. Please make some videos on Queues and Linked Lists as well.

[@PabitraPadhy]

I implemented this using a double stack method, but yours is cleaner. more importantly, it follows the same pattern as you said, so it's easier.

[@jayachandra677]

ese problems mere dimag ke upar se jata hai aur yeh tutorial tho aag laga di. thanks bhaiya :)

[@Aadyagupta5679]

bhaiya i never think that, this question is total connect with NGL problem, the way you connect the problem is lit️. thank for providing such a great content!!

[@priyasahu1439]

I am really fan of your way of teaching and explaining each and every concept

[@LuciferScripts]

Great work. I saw two solution before this vdeo but no one explain as better as you. Thank You fron Pune Institute of Technology Pune, Maharashatra

[@aisharawat9102]

Bhaiya keep adding more videos ...I don't have words to explain how helpful your videos are..

[@tanyacharanpahadi158]

Brooo you are so awesome. All the people watching this video you are really lucky to have your placements after jan 2020.

[@avinashkumarrao9728]

thanks bhaiya you are awesome the way you teach is very unique

[@AshishPal-ki8tr]

maine khud se kar liyaa ye question ,What a feeling!! thanks @Aditya Verma

[@utsavseth6573]

Please please please Aditya bhai, Keep uploading videos. Your are one person who does not do any stupid things in video, explain properly, and it's all because of you that I am able to grasp the intuition, logic and flow correctly. Please dont stop making videos. Please make videos on graphs, trees, strings topics.

[@theunusual4566]

Thanks for explaining so wonderfully. The same code approach with slight modification : public static int[] calculateSpan(int price[], int n) { int[] result = new int[n]; Stack stack= new Stack(); for(int i=0; i

[@DeepakThakur-gn7yl]

Mind blowing explanation bahiyan❤

[@sauravkumarlal896]

Thank you for the great content bhaiya, waiting for more videos...😍😍

[@AyushGupta-ux4gq]

class Solution { public: //Function to calculate the span of stock’s price for all n days. vector calculateSpan(int arr[], int n) { // Your code here stack st; int count=1; vector ans; for(int i=0;i

[@adityaagarwal637]

bhaiya ne bilkul jee wale tareke se pdaya hai , # mza aa gya :):):)

[@jishulayek8252]

U are an amazing teacher. Always like how to build the intuition part. Keep the good work going.

[@DroidHolicOfficial]

Since we are dealing with indexes here. WE can just put indexes in the stack instead of the pair. calculateSpan(price, n) { let stack = [0]; let output = new Array(n); output[0] = 1; for(let i = 1; i < n; i++){ while(stack.length > 0){ let topIndex = stack[stack.length - 1]; let top = price[topIndex]; if(top > price[i]){ stack.push(i); output[i] = i - topIndex; break; } else{ stack.pop(); } } if(stack.length === 0){ output[i] = i + 1; stack.push(i) } } return output; }

[@Aditya_6996]

thanks bhaiya , amazing teaching skills !

[@KCODivyanshuKatyan]

never seen an explaination which is this good dammn awesome man hats off.....

[@paritoshdadhich2954]

Thank you for such a great explanation. You are a gem. I tried to solve this question, tbh I mug up the solution but today I can code it with and can teach it to anyone. Thanks a ton bhaiya

[@ayushthakur2896]

Mugging up soln is also a way specially in backtracking problems .... what do u think

[@pratikgoswami2569]

waah bete moj kardi...tum toh bade heavy driver hoon

[@unknownhacker8152]

Only index, we can put and while comparison we'll take array value at that index for java, bcoz there was no concept for pair, btw, thank you so much for great videos, i love it...

[@himanshugupta2407]

og explaination big brother 🤩,looking forward to some amazing content from your side in future ,and the trick that u did with ur pen looks cool.

[@rncsMahimaMahendru]

All your videos are amazing and super understandable please upload more soon!!

[@varungupta5021]

Bhaiya agar aapke jaisa professor college mai ho to sabka placement top product based company mai to hona hi hai. Appne question hi nai pura concept build kar diya Thanks for that!

[@amanmaurya7646]

without making stack of pair of index and value we can make a simple stack storing only indices.. But it could be a bit confusing so you should use pair of stack only.

[@dhruvarora273]

Sir , thanks for providing these all important questions at one place. Sir, please upload the queue and linked list questions also .

[@mohitmehta4143]

Amazing explanations brother! Please make videos on the graph as well.

[@devanshsrivastava3185]

bhaiya please make more videos like this for different topics of data structures like trees, graphs etc. . LOve the way you teach thanks .

[@shreya-rs1fr]

we can make a single vector or array and directly push index of st.top() - I(index of element) instead of making two arrays and substracting them .

[@disharastogi5609]

amazing amazing explanation. You teach so well. Thanks a lot

[@anshumansharma4580]

I was able to do the answer myself after watching the problem statement part. Really these lectures are terrific. Instead of making an index vector, I simply made a pair with the answer that we have to return. So instead of traversing loop 2 times, we can do it in one traversal only. vector calculateSpan(int price[], int n) { // Your code here vector ans; stack S; for(int i=0;i

[@anshulpandey6576]

Same here bro . I too solved using same approach

[@sulekhakumari-hs4gy]

Thanks bro. Effectivelity utilizing my corona time watching your videos.

[@ashvinimeshram5242]

Your teaching style us just amazing

[@shivamkasat6334]

once I asked in my class group! how were you guys able to figure it out that this will be solved using stack ? And not a single person was able to answer it. but I know the answer now! Thanks!

[@MandeepKumar-ue3zy]

😂

[@raisanjeeb42]

Solved without looking at the explanation. The concept explained in 1st question is enough to tackle these question. Thank You for ur teaching🙌🙌❤

[@sanchitkumar6626]

bhaiya please upload some more videos regarding backtraking ,graph ,tree .Your Teaching style is really great .

[@harshita6683]

Thankyou i was able to solve such questions finally!

[@BruteCode2002]

Great Explanation bhaiya 😎😎😎😎

[@deepshikha787]

just awsm.. :) keep up the good work ..

[@bhavyamalviya8364]

Great work bhaiya 👏👏Truly.

[@pickled8262]

Great work Sir!!🤯

[@minkiaggarwall5529]

bhai tumne ds padi kese thoda share kardo bohat achai knowlrdge hai. sources and how to study..........best video ever seen

[@lakshaybansal9597]

Plz continue upload the video this is very helpful

[@mukulvashishth9974]

Amazing explanation brother @Aditya Verma ...Was looking for a playlist like this !!

[@jawwadakhter5261]

Great explanation...brilliant. Thank you for explaining like this. last for loop can be neglected if we calculate the NGE during the process, < l=[10, 4, 5, 90, 120, 80] # span ls=[] # Stock ans=[] # final answer vector for i in range(0,len(l)): if len(ls)==0: ans.append(1) # as given in the question, if no span. elif len(ls)>0 and ls[-1][0]>l[i]: ans.append(i-ls[-1][1]) # index-position of NGE elif len(ls)>0 and ls[-1][0]0 and ls[-1][0]

[@reshavraj4090]

Thanks buddy .!

[@kuldipchoudhary5805]

Great job man Amazing vedios ..Keep up the good work

[@AyushYadav-zn8fc]

you're a great teacher. you should make more videos on other topics

[@ashwinikumargupta7200]

class StockSpanner { public: vector arr; stack st; StockSpanner() { } int next(int price) { int day =1; while(!st.empty() && st.top().first

[@prakharagarwal4933]

thank bhaiya... your videos are very well serving it purpose

[@fahadisrar2195]

You made it look easy to identify the type. Great !!

[@sushantagawane8683]

Kudos Bro. Keep it UP!!!