Stacks And Queues
Queue Operations
Visualize FIFO behavior with enqueue, dequeue, and peek operations before moving into sliding window and scheduling patterns.
O(1)
FIFO: first in, first outoperation: peekactive value: 12
FrontRear
value12
value24
value36
value48
Time
O(1)
Space
O(n)
Step Note
Peek reads the front queue item without removing it.
function peek(queue: number[]) {
if (queue.length === 0) return null
return queue[0]
}