Coding Interview Problem - Largest Rectangle In Histogram

[@nupurkumar8781]

Finally makes sense! After reading multiple articles and watching other videos, this one finally connected all the dots for me. Thank you for the clarity!

[@gmanjapan]

Thank you for the explanation. Much better than others. There's a bug in your pseudo code toward the end - following the python style where your code blocks are indicated by indentation, before you settle on appending a 0 to the end of the heights you had an example of emptying the stack, but that code is indented to be inside the loop instead of after the loop.

[@SameerSrinivas]

Now, this is what I call a complete end to end solution. I went through other explanations with no luck. You did an awesome job explaining with such clarity and quality. Tremendous job. Thanks a lot. Keep it up!

[@naheedray]

I didn't thought the content would be that great. It turned out to be the best. Thanks for saving my day💜

[@adithyapvarma8738]

Damn. This question finally makes sense. I have been scrounging the internet to find a proper explanation for this question. Thank you kind sir!

[@iminsane7777]

Understanding thought process helps in solving not just one problem but a lot of similar problems. Love how your code evolved with your thought process.

[@arungoli9060]

I have watched 5 videos for understanding the solution and finally in the 6th video I understood the solution. And this is the 6th one Thank you

[@meht8]

For anyone looking to get comfortable with mid-level algorithm problems, this is one of the best resources here.

[@redomify]

Omg thank you for this! None of the other vids i checked added any clarity.. but this definitely did! Your animations really helped

[@AbhrajyotiKundu00]

This is the Best Explanation for the problem out there. Simply WoW!

[@samarthsoni6103]

Really great video.... please please upload more !!

[@kunzhou5159]

This is the only solution that explained the intuition. Thank you so much!

[@lindalee3879]

I really love the thought process and explanation. Thanks a bunch! :)

[@yadhunandhanr7590]

This is the way to explain algorithms, great work!!!

[@kunzhou5159]

The ONLY way.

[@AmitKumar-sj9gr]

Kudos Boss, tried 2-3 videos to understand, but this video finally made picture clear, Great work.

[@amrutansumallick9072]

i watched number of videos and read articles, ,but histogram problem i never could solve. I got the code too, but still i could not understand the inner while! Finally I have a grasp over it.

[@budsyremo]

Love your explanations. Very high quality and I encourage you to please release more of them .

[@amitpurohit8816]

Really really great explanation!!! Others only told the process but this explanation told why are we doing that process....especially I was not getting why are we pushing the elements int the stack....but now I got that actually we are tracking rectangles by doing so.....Thank you very much!!!

[@sharkdeng9253]

smart solution and clear explanation

[@ghanalkaushik2058]

By far the best solution on this topic. Thank you very much sir.

[@l.k3072]

This is awesome video. BF approach first, analysis, and drive improved solution from there.

[@sarvamsundaram]

Thanks for this awesome video. what i liked most is correcting the algorithm on the go,while learning this is a good approach. Thanks once again. PS: i have used single stack with value and index.

[@leontylahman5455]

Great explanation! Thanks a lot.

[@TheNobodyscat]

GREAT explanation. thank you.

[@rafaelcavalcantechaves81]

Great explanation, thanks

[@jwang3417]

7:47 good explaination!

[@乾淨核能]

I love how you explain you train of thoughts and adjust you pseudo code accordingly. Thank you so much!

[@pravinranjan]

Great Explanation.!! It would be great if you upload videos for more DS problems. Thank you

[@HienNguyenTechIO]

Very good explanation

[@ravikhinchi7067]

thanks man, really helped !!

[@pranjalyadav7917]

This was a real good explanation.

[@vlogwithdevesh9914]

I think the brute force approach will fail when you have minimum height at the end because it 'j' will encounter minimum height every time and will calculate area with respect to that only!!

[@iksarpek]

Great quality

[@meht8]

Awesome explanation!!!

[@sophiayue2484]

I enjoyed your video. You explained well. It is the best video regarding this topic. Where can I find the code? What is the link of Knapsak website? Thanks, Sophia

[@dungeondj4418]

Great video, thank you!

[@emilyhuang2759]

13:57 why do you push the current height, height[i] , when you are adding the shorter rectangle when height[i] is greater than hstack.peek()? Shouldn't that happen when heights[i] is LESS than hstack.peek()?

[@subee128]

Thanks

[@emilyhuang2759]

Would it be possible to push onto the stack before popping it off the rectangle? Would that help with being able to end the histogram with all rectangles popped off?

[@abdurrezzakefe5308]

Very clean explanation, keep it up!

[@abdurrezzakefe5308]

Also we can do it with just one stack.

[@lawrencejustin8136]

Forgive my ignorance but why is the width (j-i+ 1) in the brute force? I don't understand why we added 1 to it.

[@AutusDeletus98]

will this work if you input 1 2 3? It seems like it will never get into the while loop.

[@harshwardhanpatil361]

What will be the time complexity.

[@sharkdeng9253]

Could you give a working code here. Since I still failed the test. Thanks!

[@shubhamrawat7895]

Damn too good!

[@sohammalakar1899]

Doesn't the brute force algorithm fail for {3 ,1} ?

[@KnapsackLabs]

I think it would still work. On the first iteration i==j==0 so minheight would be 3 which would be our answer.

[@sohammalakar1899]

@@KnapsackLabs Yup, got it , thanks !

[@trungnguyennguyentri1975]

what if there are some rectangle with 0 height?

[@Arunkumar-pg8kx]

Both the stacks will be empty and starts tracking rectangles from scratch

[@trungnguyennguyentri1975]

@@Arunkumar-pg8kx ohhhhhh I see

[@prakharsahu7145]

ye to sach hai ki bhagwan hai