EasyDSA11 min read

What is the difference between a stack and a queue?

Q: What is the difference between a stack and a queue?

**Target Audience:** Beginners learning data structures — no prior knowledge assumed. **Difficulty:** Easy **Language:** Python 3 > **How to read this doc:** Each idea is explained in plain language first, then tagged with `📌 Interview term:` so you also learn the exact words an interviewer expects. Every program in this doc was run with `python3 main.py`, and the output quoted in the **Verified** section is copied from that run. ## 1. Why This Even Matters — A Story First In a restaurant kitchen, clean plates go onto a pile. The dishwasher puts each new plate **on top**, and the cook takes the plate **from the top**. The plate washed last is used first; the one at the bottom may sit there all evening. That pile is a **stack**. At the bakery counter outside, customers stand in a line. New customers join **at the back**, and the baker serves **from the front**. Whoever arrived first is served first, which is exactly what makes the line feel fair. That line is a **queue**. Both hol

918 views

8 of 154

The problem

Question presented to candidate: "What is the difference between a stack and a queue? Give me a real use for each, and tell me which Python types you would use to implement them and what each operation costs."

What a strong answer should cover:

LIFO versus FIFO, with the operation names (push, pop, peek; enqueue, dequeue).
All core operations are O(1), and why a queue needs a structure that is cheap at both ends.
Concrete uses: call stack, undo, bracket matching and DFS for stacks; BFS, scheduling and buffers for queues.
Related structures: deque, priority queue, circular buffer, a queue built from two stacks.
Python specifics: a list is a fine stack (append/pop), but a queue needs collections.deque (append/popleft), because list.pop(0) is O(n); queue.Queue is for threads, and heapq for priority queues.

Code / implementation expected: Optional — using the right Python built-ins, or a short undo or round-robin example.

stack
queue

Try it yourself

Sketch your approach before you read the solution. That is what the interview tests.

Stuck? Get a hint.

A short nudge toward the approach. It will not give the answer away.

Solution

Target Audience: Beginners learning data structures — no prior knowledge assumed. Difficulty: Easy Language: Python 3

How to read this doc: Each idea is explained in plain language first, then tagged with 📌 Interview term: so you also learn the exact words an interviewer expects. Every program in this doc was run with python3 main.py, and the output quoted in the Verified section is copied from that run.

1. Why This Even Matters — A Story First

In a restaurant kitchen, clean plates go onto a pile. The dishwasher puts each new plate on top, and the cook takes the plate from the top. The plate washed last is used first; the one at the bottom may sit there all evening. That pile is a stack.

At the bakery counter outside, customers stand in a line. New customers join at the back, and the baker serves from the front. Whoever arrived first

The solution is hidden so you can try first

11 min read · 13 sections

Python code

Edit the code and run it here. Each printed line with an expected value becomes a test.

PythonSame arrivals, opposite exits

Practice

PythonUndo with a stack, round-robin with a queue

Practice

Discussion

Other approaches, follow-ups and how it went in real interviews.

No comments yet. Share how you would answer it.

Question 8 of 154 in DSA

Keep your momentum going.

Mark this question solved to track your progress, then take the next one while it is fresh.

All DSA questions

Up nextEasy→

What is Big-O notation?

Continue