Please let me know if the following references/sites are helpful to you:

1.  Design and Implement Special Stack Data Structure | Added Space ...

http://www.geeksforgeeks.org/design-and-implement-special-stack-data-structure/Solution: Use two stacks: one to store actual stack elements and other as an auxiliary stack to store minimum values. The idea is to do push() and pop() ...

2.  Design a stack that supports getMin() in O(1) time and O(1) extra ...

http://www.geeksforgeeks.org/design-a-stack-that-supports-getmin-in-o1-time-and-o1-extra-space/To handle this, we push “2x – minEle” into the stack instead of x so that previous minimum element can be retrieved using current minEle and its value stored in ...

3.  Algorithm - design a stack such that getMinimum( ) should be O(1 ...

https://stackoverflow.com/questions/685060/design-a-stack-such-that-getminimum-should-be-o1Mar 26, 2009 ... EDIT: This fails the "constant space" constraint - it basically doubles the space ... getMinimum should return the minimum value in O(1); Space ..... If they are not required to be constant, then just calculate the minimum value in ...

4.  LeetCode – Min Stack (Java) - Program Creek

http://www.programcreek.com/2014/02/leetcode-min-stack-java/Design a stack that supports push, pop, top, and retrieving the minimum element in ... Define an element class that holds element value, min value, and pointer to ... LeetCode – Basic Calculator (Java) · LeetCode – Implement Queue using ...

Dennis

Dennis Mazur