How can I implement a stack using Python's collections module?

How can I implement a stack using Python's collections module?

You can use the deque class from the collections module to implement a stack. Here's a simple example:

from collections import deque

stack = deque()

# Push items onto the stack
stack.append('a')
stack.append('b')
stack.append('c')

# Pop an item from the stack
item = stack.pop()  # This will remove 'c'
print(item)

What are the advantages of using deque over a list for a stack?

Using deque is more efficient for stack operations because it provides O(1) time complexity for appends and pops, while lists can be O(n) for pops from the front.

Can you show me how to check if the stack is empty?

Sure! You can check if the stack is empty by using the len() function:

if len(stack) == 0:
    print('The stack is empty.')

How do I implement a stack with a maximum size?

You can implement a maximum size by checking the length before appending:

MAX_SIZE = 5
if len(stack) < MAX_SIZE:
    stack.append('new_item')
else:
    print('Stack is full!')