A queue is a linear data structure that follows the First-In-First-Out (FIFO) principle. You can implement a queue using a list or the collections.deque class in Python.
Solution Code
Data Structures
from collections import deque
class Queue:
def __init__(self):
self.items = deque()
def enqueue(self, item):
self.items.append(item)
def dequeue(self):
if not self.is_empty():
return self.items.popleft()
return None
def is_empty(self):
return len(self.items) == 0
# Example usage
queue = Queue()
queue.enqueue(1)
queue.enqueue(2)
queue.enqueue(3)
print(queue.dequeue())Explanation
This code snippet demonstrates how to implement a queue in Python using the collections.deque class.Guided Hints
Define a Queue class
Implement enqueue and dequeue methods
Use deque for efficient queue operations