Largest Rectangle in Histogram - Leetcode 84 - Stacks (Python)

[@GregHogg]

Master Data Structures & Algorithms for FREE at AlgoMap.io/

[@SaiyaraLBS]

Thank you so much. This was the best and most straightforward explanation after trying others... straight up and visualized clearly plus coded cleanly as well thank you!!

[@vivek.tiwary]

Thanks for this. The idea is , the moment we see dip, we process the top of stack item in backward direction.

[@anirudd01]

can we solve this with 2 pointer approach like storing rain water problem? if we are going with brute force can we use brute force + sliding window?

[@Everafterbreak_]

Great explanation, after the explanation I coded the thing by myself, and I did the exactly same code

[@JoeTan-nq4fq]

I use, for each ith rectangle, width = offset index to next smaller element + offset index to prev smaller element - 1 area is then height of the ith rectangle multiply the corresponding width, and return the max area. A little lengthy though

[@saachigupta4545]

thank you so sir this is the best explanation I can get

[@andrewcenteno3462]

Very good, this is a very complex topic

[@franciscoerramuspe]

What would I do without Greg's videos

[@sonyolcu23]

Same as NeetCode except stack tuple index and heights are interchanged.

[@ILLITAMDEVISRIPRASAD]

How to come up with solution like this😩

[@NoTMaFiA24]

hello sir you teach us very nice, but can you make videos for solve dialy question in leetcode it would be really helpful thank you

[@donkeykong5616]

not more intuitive than brute force :(

[@funnyday0]

First comment 🥇