Challenge: Implement Queue Using Stacks

Try to solve the Implement Queue Using Stacks problem.

We'll cover the following


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.


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


Level up your interview prep. Join Educative to access 80+ hands-on prep courses.