>_BeginnerCoder
Donate

Lesson 2 — Queue

FIFO

A queue: first in, first out. Use collections.deque.

Task

Enqueue A,B,C, dequeue one, print the queue.

← Back
Next →

Enjoying this lesson? Share it 👇

Keep going with Data Structures

Ready for more? These paid resources pick up where this lesson leaves off.

Some links on this page are affiliate links: we may earn a commission at no extra cost to you. We only recommend tools we believe are genuinely useful.