Since long time i am not able to implement a min-stack where in const space and const time ....... Folks please help me............if it is solved then answer is the last option
On Sun, Aug 21, 2011 at 9:15 PM, Dumanshu <[email protected]> wrote: > first option is correct. Because we are not allowed to use any extra > space. > > On Aug 21, 6:36 pm, priya ramesh <[email protected]> > wrote: > > A "Most efficient data structure" is designed to optimize the following > > operations. Pop, Push, Min. The best possible time-complexities with no > > extra space, respectively would be: > > > > ยท Pick one of the choices > > > > O(1), O(1), O(N) > > > > O(1), O(N), O(1) > > > > O(N), O(1), O(1) > > > > O(1), O(1), O(1) > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
