Queue vs Stack When to Use Which in DSA Go - Key Differences

Recall & Review

beginner

What is a Stack and how does it work?

A Stack is a data structure that works like a stack of plates. You add (push) and remove (pop) items only from the top. It follows Last In, First Out (LIFO) order.

beginner

What is a Queue and how does it work?

A Queue is a data structure like a line at a store. You add items at the back (enqueue) and remove from the front (dequeue). It follows First In, First Out (FIFO) order.

intermediate

When should you use a Stack?

Use a Stack when you need to reverse things, track recent actions, or manage nested tasks. Examples: undo buttons, backtracking, parsing expressions.

intermediate

When should you use a Queue?

Use a Queue when order matters and you want to process things in the order they arrive. Examples: task scheduling, breadth-first search, print jobs.

beginner

What is the main difference between Stack and Queue?

Stack removes the most recent item added (LIFO). Queue removes the oldest item added (FIFO). This difference decides when to use each.

Which data structure uses Last In, First Out (LIFO) order?

A Stack

B Queue

C Linked List

D Tree

Stack follows LIFO, meaning the last item added is the first to be removed.

Which data structure should you use to process tasks in the order they arrive?

A Stack

B Queue

C Graph

D Set

Queue processes items in FIFO order, so tasks are handled in arrival order.

Which of these is a common use case for a Stack?

A Priority queue

B Print job scheduling

C Undo feature in text editors

D Breadth-first search

Undo uses Stack to reverse recent actions (LIFO).

What operation adds an item to the back of a Queue?

A Push

B Dequeue

C Pop

D Enqueue

Enqueue adds an item to the back of the Queue.

If you want to explore nodes level by level in a graph, which data structure is best?

A Queue

B Stack

C Array

D Hash Map

Queue supports breadth-first search which explores nodes level by level.

Explain the main difference between a Stack and a Queue and give one example use case for each.

Think about how items are added and removed in each.

Describe a real-life situation where using a Queue is better than a Stack and why.

Imagine waiting in line at a store.

Practice

1. Which data structure should you use when you need to process items in the exact order they arrive, like customers waiting in line?

easy

A. Queue, because it processes items in First-In-First-Out order

B. Stack, because it processes items in Last-In-First-Out order

C. Array, because it allows random access

D. Tree, because it organizes data hierarchically

Solution

1. Step 1: Understand the order requirement

   Processing items in the exact order they arrive means First-In-First-Out (FIFO).

2. Step 2: Match data structure to FIFO

   Queue follows FIFO, so it fits the requirement perfectly.

3. Final Answer:

   Queue, because it processes items in First-In-First-Out order -> Option A

4. Quick Check:

   FIFO = Queue [OK]

Hint: FIFO means use Queue, like a line at a store [OK]

Common Mistakes:

• Confusing FIFO with LIFO
• Choosing Stack for order-sensitive tasks
• Thinking arrays maintain insertion order automatically

2. Which of the following is the correct way to push an element onto a stack in Go using a slice named stack?

easy

A. stack = append(element, stack...)

B. stack = stack[:len(stack)-1]

C. stack = stack + element

D. stack = append(stack, element)

Solution

1. Step 1: Recall how to add elements to a slice

   In Go, append(slice, value) adds value to the end of slice.

2. Step 2: Identify correct push operation

   Pushing onto a stack means adding to the top, which is the end of the slice, so stack = append(stack, element) is correct.

3. Final Answer:

   stack = append(stack, element) -> Option D

4. Quick Check:

   Push = append to slice end [OK]

Hint: Use append to add on top of stack slice [OK]

Common Mistakes:

• Using slicing to add elements instead of append
• Trying to add element at the front incorrectly
• Using + operator which is invalid for slices

3. What will be the output of the following Go code snippet?

queue := []int{1, 2, 3}
// Dequeue operation
queue = queue[1:]
fmt.Println(queue)

medium

A. [2 3]

B. []

C. [3]

D. [1 2 3]

Solution

1. Step 1: Understand the dequeue operation

   Dequeue removes the first element, so slicing from index 1 removes the first element.

2. Step 2: Apply slicing to queue

   Original queue is [1 2 3], after queue = queue[1:], queue becomes [2 3].

3. Final Answer:

   [2 3] -> Option A

4. Quick Check:

   queue[1:] removes first element [OK]

Hint: queue = queue[1:] removes front element [OK]

Common Mistakes:

• Thinking queue[1:] removes last element
• Confusing slice syntax with pop operation
• Expecting original queue unchanged

4. The following Go code intends to pop an element from a stack implemented as a slice. What is the error?

stack := []int{10, 20, 30}
popped := stack[len(stack)]
stack = stack[:len(stack)-1]
fmt.Println(popped, stack)

medium

A. Syntax error due to missing parentheses

B. Index out of range error when accessing stack[len(stack)]

C. Popped element is always zero

D. Stack slice is not updated correctly

Solution

1. Step 1: Check index used for popping

   Indexing in Go slices is zero-based, so last element is at len(stack)-1, not len(stack).

2. Step 2: Identify error cause

   Accessing stack[len(stack)] causes index out of range error because it is beyond last index.

3. Final Answer:

   Index out of range error when accessing stack[len(stack)] -> Option B

4. Quick Check:

   Last index = len(stack)-1, not len(stack) [OK]

Hint: Last element index is len(slice)-1, not len(slice) [OK]

Common Mistakes:

• Using len(slice) as index instead of len(slice)-1
• Not updating slice after pop
• Confusing pop with dequeue operation

5. You need to design a system that tracks the most recent 5 user actions to allow undo functionality. Which data structure is best and why?

hard

A. Array, because it allows random access to any action

B. Queue, because it keeps actions in order and removes oldest first

C. Stack, because it allows undo by removing the most recent action first

D. Linked list, because it allows fast insertion anywhere

Solution

1. Step 1: Understand undo functionality

   Undo removes the most recent action first, which is Last-In-First-Out (LIFO) behavior.

2. Step 2: Match data structure to LIFO

   Stack follows LIFO, so it is best to track recent actions and undo them in reverse order.

3. Final Answer:

   Stack, because it allows undo by removing the most recent action first -> Option C

4. Quick Check:

   Undo = LIFO = Stack [OK]

Hint: Undo needs LIFO, so use Stack [OK]

Common Mistakes:

• Choosing Queue which removes oldest first
• Thinking array random access helps undo
• Ignoring order of undo operations