Stacks And Queues
Queue Operations
Visualize FIFO behavior with enqueue, dequeue, and peek operations before moving into sliding window and scheduling patterns.
O(1) per operation
FIFO: first in, first outoperation: dequeue
FrontRear
value12
value24
value36
value48
Time
O(1) per dequeue
Space
O(n)
Step Note
Start with a filled queue. Dequeue always removes the front item.
function dequeueAll(queue: number[]) {
while (queue.length > 0) {
const front = queue[0]
queue.shift()
}
return queue
}