Implement Queue Using Stacks

Problem

Implement a queue using two stacks. Create a class MyQueue that supports push(x) to add an integer to the back of the queue, pop() to remove and return the front element, peek() to return the front element without removing it, and empty() to return whether the queue is empty. All operations should behave like a standard FIFO queue.

Constraints

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