Interview Bootcamp
Ask Author
Back to course home

0% completed

Vote For New Content
Solution: Implement Stack using Queues

Problem Statement

Implement a stack using only two queues. The stack should behave like a typical last-in-first-out (LIFO) stack, meaning that the last element added should be the first one to be removed.

Implement a Solution class that supports the following operations:

  • Solution(): A constructor to initialize the object.
  • push(int x): Adds an element x to the top of the stack.
  • pop(): Removes the element from the top of the stack and returns it.
  • top(): Retrieves the element on the top of the stack without removing it.
  • `empty()

.....

.....

.....

Like the course? Get enrolled and start learning!