Largest Area under Histogram efficient algorithm using Stack | Coding Interview Question

How to find out the largest area under Histogram in a Stack ? Learn to solve in this tutorial :)
For more online courses visit - www.codingblock...
Check courses on - online.codingbl... [Free Trial Available]
Coding Blocks is pleased to announce courses like C++ and Java, Data Structures and Algorithms, Web and Android Development(Java and Kotlin), Competitive Programming, Coding Interview Preparation and Machine Learning, AI and more.
#CodingBlocks #ProgrammingMadeEasy #LearnCodingOnline
Like our FaceBook Page - / codingblocksindia
Follow us on Instagram - / codingblocks
Follow us on Twitter - / codingblocksin
Source code available on -github.com/cod...
For more interesting tutorials - / @codingblocksindia

[@noone_and_nobody]

I went through atleast a few videos before giving this one a try and boy, it was completely worth it. The explanation with a running example, just superb. Kudos to the team!

[@NareshKumar-dw9xp]

This is the best explanation I have ever seen about any question. Everyone is running behind codes but no one is talking about mathematics behind that. I have seen a lot of videos related to this but did not satisfy. But now I am fully confident in these problems. Thank you so much , you always use to explain hard problems in quite easy manner .

[@kvishalreddy_3742]

best explanation thanks

[@baurks]

The best explanation so far. I am still lagging behind on the intuition, but now I can prove the algorithm by induction.

[@cyanzhoufeng]

I don't know why so many ppl downvote this excellent presentation , this is best explanation I found, rather than other videos which just show the formula and conclusion only. Thanks for the detailed illustration

[@tusharsinha1772]

The only explanation on youtube for this problem which makes sense.

[@JuanSB827]

Finally an explanation that makes sense!

[@vanshthukral5477]

Expressing my gratitude to everyone who made creation of this video possible.A really simple ,thorough and good explanation.

[@CodingBlocksIndia]

Thanks Vansh !!

[@mello.maniac]

the approach was nice, I liked the explanation with a proper example, Just one suggestion: please remove double logos from the bottom right corner.

[@SlyGoblin927]

Dude, you saved my day. all the remaining videos were a waste of time. 🤔 I wonder how the hell did the first person who solved this question in the world got this idea or thought of this algorithm. It's just amazing 🤯

[@aasdffew]

He must have been a genius...

[@saurabhverma2729]

I feel the same for the person who designed this problem.

[@ananyasharma101]

Best solution to this problem among all videos

[@shagun9155]

Woow what a worthy explanation:-) only now I am able to get the intuition of this problem

[@CodingBlocksIndia]

Great. Keep Learning with Coding Blocks!

[@AmanKumar-hr5dc]

Very nice explanation Now i got the intution behind this!

[@sachingoyal6197]

Finally got it after going through so many videos.

[@venuvenu2719]

I still have no idea how someone gets idea to use stack for this problem

[@harshitsaini15]

@@venuvenu2719 Yes, I'm thinking the same :(

[@swapnikapandey6882]

easiest explanation so far.Keep making such videos.

[@WimpyWarlord]

Set the speed to 1.25 or 1.5 and thank me later. The video was a lot better than others made on similar topic , yet you would have to develop the intuition on your own .

[@aasdffew]

Now I am able to understand the logic, thanks

[@anirudhatalmale5575]

The best and simplest explanation.

[@ShaliniNegi24]

Honestly very nice explanation.

[@rajugaurav5052]

Thank you so much , finally I understand the intuition behind this algorithm :))

[@nayankhuman1043]

best explanation ever

[@katyayanikrishnan8725]

best video so far on this topic.

[@ajitdavis5100]

very well explained thank you so much

[@sakibthetech]

best explanation..Thanks

[@sprajapati2011]

You just ammmazingly explained.

[@CodingBlocksIndia]

Thanks💕

[@nafishaftab9323]

Best explanation.....even better than geeksforgeeks

[@sukritkapil2562]

Nice explanation. Thanks!

[@HumorHubIndi]

Thanks a lot..grt explanation..excellent work!!

[@israelmcculley2927]

I found your explanation confusing because the first step you explained was that you would only push an index onto the stack if the height is larger than the previous height, but then you went on to push literally every single element into the stack regardless of its height comparison with the previous height.

[@ujjvalsharma5055]

I really appreciate what you did here. Amazing work and such explanation was missing in others. I encourage to put out more video and keep up the good work.

[@reassume4826]

Thank You Coding Blocks.

[@ajaygaur3392]

explanation starts at 11:00 and it is great

[@tushargupta1107]

thanks bro

[@imalive404]

By far the best video on this problem. Kudos _/\_

[@CodingBlocksIndia]

Thanks!! Do Subscribe for more such videos

[@sanketkale730]

Thnax man...really helpful!! keep it up!

[@harshitsaini15]

This is one hell of a notorious problem I have ever seen and the most fabulous explanation given for it :)

[@mohammedsuhailbasha4860]

Very nice lecture...... always upload this type of lectures bro.this will more helpful to us

[@CodingBlocksIndia]

Check out complete course at online.codingblocks.com

[@vartikavarshney8303]

its long but definitely worth it

[@sachingarg4385]

That's what she said :p

[@prateekmishra6245]

@@sachingarg4385 :)

[@rishulmatta16]

Amazing explanation loved it! Scroll to 13:41

[@punitpawar4231]

Thanks for this video. Nice Explanation. Where is the video or the link to the code ?

[@participiopassado]

Thank you very much for the explanation. Now I finally understood this question! Subscribed!

[@CodingBlocksIndia]

Thank you so much !!

[@jeeruajay2111]

Very good Explination

[@piyushjaiswal4866]

Example is same as in GFG article

[@sumanreddyg8245]

@ 7:46 you explained [R-L-1] * hight of the minimum current bar popped from stack , again in the diagram L = 0 and R=4 then its [4-0-1]*3 = 9 right .. and why there is extra -1 in the formula [R-L-1] , also i understood L and R bars height is less than the current bar popped up from the stack please explain this point , apart from this every thing is understood

[@anshusharma1983]

If index 4 is the right hinderance and 0 index is the left hinderance. Then the rectangle consists of indexes 1, 2 & 3. Hence (R-L) -1 i.e. (4-0)-1 as the left is not inclusive, it is the hinderance before the last bar. Hope this helps

[@MaulikSakhida]

7:45 Area = (R - L - 1) * Height of current bar, So It should be, Area = (4 - 0 - 1 ) * 3 ?

[@VishalKumar-kr9me]

Yes you are r8...He has written that by mistake...

[@agrox29]

Glad to see so many paid comments here

[@bvsrevanth6856]

I actually like their explanation ,but this is one of the worst explanation I have ever seen

[@mayurkoli4145]

what if bar's are in increasing order eg -> 1, 2, 4, 5, 6, 7

[@zod1ack_csgo_clips425]

It will be the worst case scenario for this algo with O(2n) complexity.

[@akshbansal7715]

We can add 0 at the end of the array.

[@shivampawar5074]

But what if the numbers are in increasing order e.g. 1,2,3,4,5 ?

[@ManishKumar-zt5sk]

great explanation once again!!!!!!!!!

[@CodingBlocksIndia]

Thanks Manish

[@suharajsalim4549]

Thanks a lot :)

[@ShubhamKumar-rt8nb]

Finally I understood it

[@CodingBlocksIndia]

Glad you liked our video.

[@farhan787]

For O(n^2) solution, how would I be able to know that what is the minimum height bar in (i, j) range ? at 2:30

[@MohitKumar-yr4rl]

My solution #include using namespace std; int local_min(int arr[],int i,int j) { int min=arr[i]; for(int p=i+1;parr[p]) min=arr[p]; } return min; } int main() { int arr[]={6,2,5,4,5,1,6}; int n=7; int area=0; for(int i=0;i

[@rhythmbhatia8906]

// Largest area under histogram // O(n^2) #include #include using namespace std; int histogram(int a[],int n) { int min,area,i,j,ans=0; for(i=0;in; for(i=0;i>a[i]; cout

[@devcoder3107]

Please add code section in description.

[@RAJPATEL-nm9nz]

very good eplanation bt initial 10mins are boring.

[@giangkhuat9343]

Thanks a lot ! I was able to follow through and wrote the code myself. Best explaining video so far on this problem

[@CodingBlocksIndia]

Thanks Glang for the compliment. please subscribe for more such videos.

[@jeeruajay2111]

Sir, I didn't find this type of video. Extraordinary ,,super,,

[@The_Helping_Hand_1997]

Thanks Sir...

[@VishalKumar-kr9me]

WHAT IF THE CURRENT NUMBER IS EQUAL TO THE TOP OF THE STACK???????

[@riddhidutta7411]

I coded according to your algorithm...ideone.com/LjOjXm (my solution) but in www.spoj.com/problems/HISTOGRA/ its giving tle....pls help

[@yashbhardwaj7756]

please provide the code as well

[@ArpitDhamija]

How to open the source code on GitHub

[@MDMIRU152]

Ok

[@adityavandansharma1575]

* shows gratitude *

[@ManishThakur-jp7zm]

watch at *1.5, your welcome!

[@sulaimant5690]

thenks.

[@sambhumahato8320]

wow!

[@Great_one1]

can u please prove us the code?

[@ayushaggarwal4714]

You just can't do this on your own right?

[@yatharth_er]

nice

[@Oswee]

Aaaand.... what is the real-world use case of this? Why would i need this?

[@zyro9922]

0:26

[@piyushjaiswal4866]

This is not any valid reason that pop and push only once make it O(n)

[@ayushthakur733]

came here with some expectations , explanation is not good i didn't understand any part of it

[@sommayghosh4617]

worth watch for 30 mins !

[@TheRkrrockstar]

so many ads

[@premangraithatha8273]

i don't understand anything

[@nicolasgoosen5142]

Thanks for the useful video, but, man, I never heard such a monotonous voice drawing out it's words in such a dull and languid way. Sheesh!

[@abhishekagarwal2522]

What if the first bar is of 100 units alone.

[@abhishekagarwal2522]

Its own area will be 100*1=100

[@ciphertester1147]

Thanks for making your video but your area calculation creates too much magic. If you code this you will find your containers are missing important data. Using a stack you need to keep the height as well as the valid starting point. Using your example the data would look like these pairs (6,0),(2,1),(5,2),(4,2),(1,0),(6,6). It would be to your benefit to code this before teaching/explaining to others. Here's a test case I used : {2,6,3,2,5,5,5,4,4,5,1,7}. Happy Hacking!

[@shauvikpujari9522]

Explanation is outstanding keep it up bro👍