tag:blogger.com,1999:blog-8522573717713847738.post3179510464654542664..comments2024-03-28T00:14:29.070-07:00Comments on Yu's Coding Garden : leetcode Question: Min StackAnonymoushttp://www.blogger.com/profile/00263085222060621782noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-8522573717713847738.post-1619153316289410142016-06-12T16:29:01.953-07:002016-06-12T16:29:01.953-07:00Your pop() is taking O(n) time complexity it can b...Your pop() is taking O(n) time complexity it can be done in O(1).<br />Just use an extra stack to handle the minimum value at the moment.Anonymoushttps://www.blogger.com/profile/03656475596240838394noreply@blogger.comtag:blogger.com,1999:blog-8522573717713847738.post-60762252553475988132015-08-22T06:13:11.773-07:002015-08-22T06:13:11.773-07:00This comment has been removed by the author.senseappealhttps://www.blogger.com/profile/09351328417949661872noreply@blogger.com