Amazon Coding Interview Question - Min Stack (LeetCode)

[@NextInterviewPrep]

Your videos are so very good, they put everything into the head right away

[@AlgosWithMichael]

Thank you! That is the goal

[@ashwinhariharan310]

Thanks @Micheal Muinos for these awesome videos. The content is fantastic. Making complex/simple/moderate concepts simple in such a crystal clear manner, and in a very breezy way without excessive jargon. So good while preparing for interviews. You have helped me cement my understanding on things so well

[@TP-xt4sv]

I love you so much since your explanation always helps me A LOT.

[@ChandraShekhar-by3cd]

@ Michael Muinos Thanks a lot for such a great explanation . Could you please upload more frequent videos on leetocode and DSA, it is really very informative to get the concepts from you!

[@chaitanyakarthik3536]

this was nice explanation bro, really loved it!!

[@yitingg7942]

Thanks a lot for another great video!! I am waiting for more each day. How do you come up with this solution? It's easy to implement but hard to come up with.

[@AlgosWithMichael]

Just alot of practice and the more problems you do, the easier to come up with solutions like this will be!

[@priyanshrastogi4351]

You explain really good 👍. Keep it up.. Please solve Sliding window median, Minimum falling path sum. If you have time..

[@AlgosWithMichael]

Hey, thanks man! Also, I've done videos on both of the topics mentioned. Sliding window medium - kzbin.info/www/bejne/apqZXmx_r7Z7rdE Minimum path sum - kzbin.info/www/bejne/bl6ZfoKibNVqh9U Take care!

[@priyanshrastogi4351]

@@AlgosWithMichael buddy i am asking you to solve Minimum falling path sum Thanks

[@AlgosWithMichael]

Thought they were the same problem, mb lol

[@deepakmarneni2110]

Awesome.. great explanation.. waiting for more video's.

[@AlgosWithMichael]

Thank you very much!

[@namratavishwaskelkar6853]

Thank you so much!

[@vinoddiwan5792]

need to modify code because empty stack gives error now.

[@heisenberg1844]

Well explained.Thanks.

[@AlgosWithMichael]

No problem!

[@sahilattri51]

You are awesome!

[@rchukkapalli1]

Do we really need to add the same value multiple times? can we just check the "peek()" and if it is less, then we can add right? great explanation and thank you for the videos.

[@AlgosWithMichael]

Yes, you are correct. We do not have to add the same value multiple times if we don't want to. It will still be the same time and space complexity however. Thank you for watching!

[@TheMcallist1]

Great vid - thanks

[@AlgosWithMichael]

Glad you enjoyed it!

[@bhanugupta4093]

Recently i gave an interview the interviewer ask the same question but he also wants constant space Complexity means without using extra stack. can you please explains this also. Thank You

[@AlgosWithMichael]

Yea, I can do a follow up vid