Leetcode 225 Implement Stack using Queues Solution in c++ | Hindi Coding Community

 

Implement a last-in-first-out (LIFO) stack using only two queues. The implemented stack should support all the functions of a normal stack (push, top, pop, and empty).

Implement the MyStack class:

void push(int x) Pushes element x to the top of the stack.

int pop() Removes the element on the top of the stack and returns it.

int top() Returns the element on the top of the stack.

boolean empty() Returns true if the stack is empty, false otherwise.

class Stack {

    queue<int> q;

public:

    void push(int x) {

        q.push(x);

        for (int i=1; i<q.size(); i++) {

            q.push(q.front());

            q.pop();

        }

    }

    void pop() {

        q.pop();

    }

    int top() {

        return q.front();

    }

    bool empty() {

        return q.empty();

    }

};