Stack implementation in python?

Question

Python

how to implement stack in python?
with adding elements via push and removing elements via pop

Answer 1

list is already the most classic stack. adding to the end in O(1). deleting from the end is also in O(1)

Answer 2

Alternatively, you can use Queue , or collections.deque

from collections import deque
q = deque()
 
q.append('10') # push
q.append('20') # push
q.append('30') # push
 
print(q)
# deque(['10', '20', '30'])

print(q.pop()) # pop
# 30
print(q.pop()) # pop
# 20
print(q)
# deque(['10'])