// QUEUE_(FIFO)

Queue (FIFO)

Beginner

A First-In-First-Out data structure. Enqueue adds to the back, dequeue removes from the front. Like a queue at a coffee shop.

time:O(1) per op

space:O(n)

⚡ +100_XP

step[1/9]

> Start

Queue: FIFO — First In, First Out. Like a real queue: first person in line is first served.

// tap NEXT STEP to walk through one step at a time