Challenge: Implement Queue Using Stacks

Statement

Design a queue data structure using only two stacks and implement the following functions:

• enqueue(int x): Inserts a value to the back of the queue.
• dequeue(): Removes and returns the value from the front of the queue.

Constraints:

• $-10^5 \leq$ x $\leq 10^5$

Examples