=begin
Implement a first in first out (FIFO) queue using only two stacks.
The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).
Implement the MyQueue class:

void push(int x) Pushes element x to the back of the queue.
int pop() Removes the element from the front of the queue and returns it.
int peek() Returns the element at the front of the queue.
boolean empty() Returns true if the queue is empty, false otherwise.
Notes:

You must use only standard operations of a stack, which means only push to top, peek/pop from top, size, and is empty operations are valid.
Depending on your language, the stack may not be supported natively.
You may simulate a stack using a list or deque (double-ended queue) as long as you use only a stack's standard operations.

Constraints:

1 <= x <= 9
At most 100 calls will be made to push, pop, peek, and empty.
All the calls to pop and peek are valid.
 

Follow-up: Can you implement the queue such that each operation is amortized O(1) time complexity? In other words,
performing n operations will take overall O(n) time even if one of those operations may take longer.
=end

#Solution
class MyQueue
    def initialize()
        @queue = []
        @spare_stack = []
    end


=begin
    :type x: Integer
    :rtype: Void
=end
    def push(x)
        until @queue.empty?
            @spare_stack.push(@queue.pop)
        end
        @queue.push(x)
        until @spare_stack.empty?
            @queue.push(@spare_stack.pop)
        end
    end


=begin
    :rtype: Integer
=end
    def pop()
       @queue.pop 
    end


=begin
    :rtype: Integer
=end
    def peek()
       @queue[-1] 
    end


=begin
    :rtype: Boolean
=end
    def empty()
        @queue.length == 0
    end


end

# Your MyQueue object will be instantiated and called as such:
# obj = MyQueue.new()
# obj.push(x)
# param_2 = obj.pop()
# param_3 = obj.peek()
# param_4 = obj.empty()