Dequeue
Domain: Data Structures
🎯 Motivation
Dequeue is the operation of removing and returning the front item from a queue.
📋 Concrete Example
q.popleft() removes and returns the item at the front. The next item moves up to become the new front.
🔗 Analogy
The person at the front of the queue gets their food and leaves. The second person steps up to the counter.