Implement Stack using Queues — Easy DSA Problem

Problems/278. Implement Stack using Queues

⌥

Visualizer will appear here

1class MyStack:

2 def __init__(self):

3 self.q = []

4 def push(self, val):

5 self.q.append(val)

6 for _ in range(len(self.q) - 1):

7 self.q.append(self.q.pop(0))

8 def pop(self): return self.q.pop(0)

9 def top(self): return self.q[0]

Visualizer

⌥

Visualizer will appear here