Min Stack

Design a stack that supports push, pop, top, and retrieving the minimum element in constant time.

• push(x) -- Push element x onto stack.
• pop() -- Removes the element on top of the stack.
• top() -- Get the top element.
• getMin() -- Retrieve the minimum element in the stack.

  class MinStack {
  	Stack<Integer> stack1 = new Stack<Integer>();
  	Stack<Integer> stack2 = new Stack<Integer>();
  
  	public void push(int x) {
  		stack1.push(x);
  		if (stack2.isEmpty() || stack2.peek() >= x)
  			stack2.push(x);
  	}
  
  	public void pop() {
  		if(stack1.pop().equals(stack2.peek())){
  			stack2.pop();
  		}
  	}
  
  	public int top() {
  		return stack1.peek();
  	}
  
  	public int getMin() {
  		return stack2.peek();
  	}
  }