Daily Temperatures (LeetCode 739) | Full solution with animations and examples | Study Algorithms

[@nikoo28]

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.

[@abheermehrotra329]

Best and the easiest explanation till nowwwwww

[@redhair1401]

One thing that help me in this video was that you remender me that it is a problem similar to next greatest element

[@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.

[@arunikaharit7203]

Viewers : Solution starts from 5:52 , Welcome!!

[@himanshu1304]

very clear explanation ! thank you

[@nikoo28]

Glad it helped

[@islamwaled5956]

daaaaaaaamn , i have a headache but i feel happy also thank you bro thats helped a lot

[@anshumaan1024]

nice explanation 🙂

[@samarthtandale9121]

Amazing explanation! Please upload the solution of 'Word Search 2' problem using the trie data structure?

[@mohitnegi724]

Thank you for this. You're a excellent teacher.

[@sanjammanagi6562]

great explaination

[@abheermehrotra329]

Thank youuuuuuuuu so muchhhh bhaiyaaaaaaaa 😍😍😍😍😍😍😍😍😍😍

[@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

[@ryanren7273]

This helps a lot!! Followed.

[@satyamgupta6030]

what a great explaination bhaiya thanks alot . Please keep making such amazing videos.

[@nikoo28]

Always welcome

[@monishrainy8568]

great explanation

[@lalanabiridi8358]

brilliant brilliant

[@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

[@mkd2002]

Hey Thanks Man!

[@hannanhub1717]

thanks sir

[@subee128]

Thank you

[@astik2002]

can anyone provide me the Python Code, Great explanation, I thoroughly understood the code

[@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.

[@sharikkumar-z9x]

u are using stack and array both , still space complexity is o(n) how?

[@sohaildarwajkar9979]

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.

[@himanshuranjan8657]

69 and 71 ko push krvane vala step gyab kr diya apne confusion ho gya ! aage se dyan degeye aaise mat krye

[@nikoo28]

so sorry for that, I have added a comment to clear the confusion

[@aviralarpan7350]

LOL