Implement Queue using Stacks

A queue hands its values back in the order they arrived, like a line at a shop: the first value pushed is the first one to leave. A stack does the opposite: the last value pushed leaves first. Build a queue out of two stacks, using only what a stack can do: add a value on top, look at or remove the top value, and check whether it is empty.

Implement the class MyQueue:

• MyQueue() creates an empty queue.
• push(x) adds the integer x at the back of the queue.
• peek() returns the value at the front of the queue, without removing it.
• pop() removes the value at the front of the queue and returns it.
• empty() returns True if the queue holds no values, and False otherwise.

The input is a list of operations, applied in order to one new MyQueue. The output lists what the peek, pop and empty calls return, in order. The starter code spells these names the way your language does.

Example 1:

Input:
    push(1)
    push(2)
    peek()
    pop()
    empty()
Output: 1 1 False
Explanation:
1 arrived first, so it is at the front: peek() returns 1, and pop() removes it and returns it.
2 is still in the queue, so empty() is False.

Example 2:

Input:
    push(1)
    push(2)
    pop()
    push(3)
    peek()
    pop()
    pop()
    empty()
Output: 1 2 2 3 True
Explanation:
pop() returns 1, the first value pushed. 3 arrives next, but 2 has been waiting longer,
so peek() and the next pop() return 2, and only then does pop() return 3. The queue is empty again.

Example 3:

Input:
    empty()
    push(7)
    empty()
    pop()
    empty()
Output: True False 7 True
Explanation: A new queue is empty. After push(7) it isn't, and after pop() returns 7 it is empty again.

Constraints:

• 1 <= x <= 109
• pop and peek are only called when the queue is not empty.
• At most 2 * 105 calls in total are made to push, pop, peek and empty.