At 8:33 I forget to push the element 69 or index [4] in the stack. Sorry for the confusion. In the next iteration it will pop out since 69 is smaller than 71.
@abheermehrotra3292 жыл бұрын
Best and the easiest explanation till nowwwwww
@redhair14012 жыл бұрын
One thing that help me in this video was that you remender me that it is a problem similar to next greatest element
@arunikaharit7203Ай бұрын
Viewers : Solution starts from 5:52 , Welcome!!
@molyoxide8358 Жыл бұрын
At 8:40 why didn't you store 69 ??
@nikoo28 Жыл бұрын
You are absolutely correct, 69 should have been added to the stack. My error. Thanks for pointing that out. The solution will still remain the same though as 69 will get popped out in the next step.
@molyoxide8358 Жыл бұрын
@@nikoo28 For 2 days I was frustrated due to this one thing, I was really confused whether did I missed something or it was something from your side. BTW that day I had disliked this video but today after this clarity I have reversed it now. Liked it buddy👍
@nikoo28 Жыл бұрын
@@molyoxide8358 once again...so sorry for the confusion
@roto7648 Жыл бұрын
Thanks buddy, had the same doubt!
@everyontech2716 Жыл бұрын
I was also confused with this part. I did dry run twice and realize its video mistake. But, looking at comments i was 100% sure it was video mistake. @nikhil can you add something video for future clarification or you can also pin these comments. Thanks
@sanand6084 Жыл бұрын
Great bhai !!! I know you are a busy man but can you please upload more questions from leetcode (when you find time) ? Your way of explaining is really good.
@nikoo28 Жыл бұрын
Thanks Anand, I upload a video every week and try to be consistent with it. Creating videos in this depth and quality takes a bit of time. I don’t want to compromise on the quality. Hope you understand.. :) My videos are made in such a way that you can watch them on any device.
@himanshu13042 жыл бұрын
very clear explanation ! thank you
@nikoo282 жыл бұрын
Glad it helped
@samarthtandale9121 Жыл бұрын
Amazing explanation! Please upload the solution of 'Word Search 2' problem using the trie data structure?
@anshumaan10249 ай бұрын
nice explanation 🙂
@sanjammanagi6562 Жыл бұрын
great explaination
@mohitnegi724 Жыл бұрын
Thank you for this. You're a excellent teacher.
@islamwaled5956 Жыл бұрын
daaaaaaaamn , i have a headache but i feel happy also thank you bro thats helped a lot
@monishrainy8568 Жыл бұрын
great explanation
@abheermehrotra3292 жыл бұрын
Thank youuuuuuuuu so muchhhh bhaiyaaaaaaaa 😍😍😍😍😍😍😍😍😍😍
@satyamgupta6030 Жыл бұрын
what a great explaination bhaiya thanks alot . Please keep making such amazing videos.
@nikoo28 Жыл бұрын
Always welcome
@anagnaikgaunekar9081Ай бұрын
I have coded a 2 pointer approach for this. But somehow leetcode is giving time limit exceeded for a very large array
@praneashk7797 Жыл бұрын
wow literally the explanation is vvvvvgood man keep it up
@lalanabiridi8358 Жыл бұрын
brilliant brilliant
@ryanren7273 Жыл бұрын
This helps a lot!! Followed.
@hannanhub17173 ай бұрын
thanks sir
@subee12811 ай бұрын
Thank you
@mavachill Жыл бұрын
As we are using stack can we write a recursive code for this question
@nikoo28 Жыл бұрын
what will be your approach? try creating a pseudo code for it.
@astik2002 Жыл бұрын
can anyone provide me the Python Code, Great explanation, I thoroughly understood the code
@sharikkumar-z9x3 ай бұрын
u are using stack and array both , still space complexity is o(n) how?
@sohaildarwajkar99792 ай бұрын
Since we are using array to return the answer which question itself asks us to so we are not using extra O(N) to solve the question.
@mkd2002 Жыл бұрын
Hey Thanks Man!
@himanshuranjan865710 ай бұрын
69 and 71 ko push krvane vala step gyab kr diya apne confusion ho gya ! aage se dyan degeye aaise mat krye
@nikoo2810 ай бұрын
so sorry for that, I have added a comment to clear the confusion