tag:blogger.com,1999:blog-3418265334198879901.post2815661243120921709..comments2023-06-10T14:12:41.433+05:30Comments on Coders Stop: Largest area in a HistogramAviralhttp://www.blogger.com/profile/11920144614598355124noreply@blogger.comBlogger1125tag:blogger.com,1999:blog-3418265334198879901.post-527573915250066872014-06-14T01:13:08.123+05:302014-06-14T01:13:08.123+05:30Woww, incredible solution. I've tried calculat...Woww, incredible solution. I've tried calculating for each i, the previous element that is less than him and store it in another array. I think that works just the same as your solution but yours is much easier to analyse and to prove it's O(n). :)Gastón Bengolea Monzónhttps://www.blogger.com/profile/14319605497987853604noreply@blogger.com