Could not understand from the video

#1

Can you please explain to me the solution in another way?

#2

Hi @Avi-Kasliwal-315786729062203

please go through this algo
algorithm would be
1) Create an empty stack.

2) Start from first bar, and do following for every bar ‘hist[i]’ where ‘i’ varies from 0 to n-1.
…… a) If stack is empty or hist[i] is higher than the bar at top of stack, then push ‘i’ to stack.
…… b) If this bar is smaller than the top of stack, then keep removing the top of stack while top of the stack is greater. Let the removed bar be hist[tp]. Calculate area of rectangle with hist[tp] as smallest bar. For hist[tp], the ‘left index’ is previous (previous to tp) item in stack and ‘right index’ is ‘i’ (current index).

3) If the stack is not empty, then one by one remove all bars from stack and do step 2.b for every removed bar.

and then i recomment to go through through prateek bhaiyas videos or some online video on youtube
on watching twice and dry run that on pen paper u`ll understand it.

1 Like