Queue Using Two Stacks in DSA C# - Cheat Sheet & Quick Revision

Recall & Review

beginner

What is the main idea behind implementing a queue using two stacks?

Use one stack to handle incoming elements (enqueue) and another stack to handle outgoing elements (dequeue). When the dequeue stack is empty, transfer all elements from the enqueue stack to reverse their order, simulating queue behavior.

beginner

In a queue implemented with two stacks, what happens during the dequeue operation if the dequeue stack is empty?

All elements from the enqueue stack are popped and pushed into the dequeue stack, reversing their order. Then the top element of the dequeue stack is popped and returned.

beginner

Why does transferring elements from one stack to another reverse their order?

Because stacks are Last-In-First-Out (LIFO), popping elements from one stack and pushing them into another reverses the order, turning the newest element into the bottom and the oldest into the top.

intermediate

What is the time complexity of enqueue and dequeue operations in a queue implemented using two stacks?

Enqueue operation is O(1) because it just pushes onto the enqueue stack. Dequeue operation is amortized O(1) because transferring elements happens only when the dequeue stack is empty, spreading the cost over multiple operations.

intermediate

Show the state of the two stacks after enqueueing 1, 2, 3 and then dequeueing one element in a queue implemented with two stacks.

After enqueue 1,2,3: enqueueStack = [1,2,3], dequeueStack = []. After dequeue: enqueueStack = [], dequeueStack = [3,2], returned element = 1.

What data structure is used to reverse the order of elements in a queue implemented with two stacks?

A Stack

B Queue

C Linked List

D Array

Stacks reverse order because they are Last-In-First-Out (LIFO).

When do we transfer elements from the enqueue stack to the dequeue stack?

A When dequeue stack is empty

B When enqueue stack is empty

C After every enqueue operation

D After every dequeue operation

Transfer happens only when dequeue stack is empty to maintain correct order.

What is the worst-case time complexity of a single dequeue operation in a queue using two stacks?

A O(1)

B O(log n)

C O(n^2)

D O(n)

In worst case, all elements are moved from enqueue stack to dequeue stack, which is O(n).

What is the amortized time complexity of dequeue operation in a queue using two stacks?

A O(n log n)

B O(1)

C O(log n)

D O(n)

Amortized over many operations, dequeue is O(1) because transfers happen rarely.

Which stack holds the elements ready to be dequeued in a queue implemented with two stacks?

A Enqueue stack

B Both stacks

C Dequeue stack

D Neither stack

Dequeue stack holds elements in correct order for dequeue.

Explain how a queue can be implemented using two stacks. Describe the roles of each stack and how enqueue and dequeue operations work.

Think about how stacks reverse order and how that helps simulate queue behavior.

Describe the time complexity of enqueue and dequeue operations in a queue implemented with two stacks and explain why dequeue is amortized O(1).

Consider how often the costly transfer happens compared to cheap pops.

Practice

1. What is the main idea behind implementing a Queue using two stacks?

easy

A. Use one stack for enqueue and another for dequeue operations

B. Use two stacks to store elements in sorted order

C. Use two stacks to reverse the order twice to maintain queue order

D. Use two stacks to store only even and odd elements separately

Solution

1. Step 1: Understand queue order

   A queue follows First-In-First-Out (FIFO) order, meaning the first element added is the first removed.

2. Step 2: Use two stacks to reverse order twice

   One stack reverses the order when pushing elements, and the second stack reverses it back when popping, maintaining FIFO.

3. Final Answer:

   Use two stacks to reverse the order twice to maintain queue order -> Option C

4. Quick Check:

   Two reversals keep FIFO order [OK]

Hint: Two stacks reverse order twice to simulate queue [OK]

Common Mistakes:

• Thinking stacks store sorted elements
• Using stacks for separate data types
• Confusing enqueue and dequeue roles

2. Which of the following is the correct syntax to push an element 5 into a stack named stack1 in C#?

easy

A. stack1.Push(5);

B. stack1.Add(5);

C. stack1.Insert(5);

D. stack1.Enqueue(5);

Solution

1. Step 1: Recall stack push method

   In C#, the Stack<T> class uses the Push method to add elements.

2. Step 2: Check method names

   Add and Insert are not stack methods; Enqueue is for queues.

3. Final Answer:

   stack1.Push(5); -> Option A

4. Quick Check:

   Stack push method = Push() [OK]

Hint: Use Push() to add elements to stack [OK]

Common Mistakes:

• Using Add() or Insert() which are not stack methods
• Confusing Enqueue() with Push()
• Using wrong method names

3. What will be the output of the following C# code implementing a queue using two stacks?

var queue = new QueueUsingTwoStacks();
queue.Enqueue(10);
queue.Enqueue(20);
queue.Enqueue(30);
Console.WriteLine(queue.Dequeue());
queue.Enqueue(40);
Console.WriteLine(queue.Dequeue());

medium

A. 30\n40

B. 10\n20

C. 20\n30

D. 10\n30

Solution

1. Step 1: Enqueue elements 10, 20, 30

   Elements are pushed into the first stack in order: 10, then 20, then 30.

2. Step 2: Dequeue operation

   On dequeue, elements are popped from the second stack after transferring from the first, so 10 is dequeued first.

3. Step 3: Enqueue 40 and dequeue again

   40 is pushed into the first stack. Next dequeue returns 20, the next in queue order.

4. Final Answer:

   10 20 -> Option B

5. Quick Check:

   FIFO order maintained: 10 then 20 [OK]

Hint: Dequeue returns oldest enqueued element first [OK]

Common Mistakes:

• Assuming dequeue returns last pushed element
• Not transferring elements between stacks correctly
• Mixing enqueue and dequeue order

4. Identify the error in the following C# code snippet for dequeue operation in a queue using two stacks:

public int Dequeue()
{
    if (stack2.Count == 0)
    {
        while (stack1.Count > 0)
            stack2.Push(stack1.Pop());
    }
    return stack1.Pop();
}

medium

A. Should pop from stack2, not stack1, after transfer

B. Should check if stack1 is empty before popping

C. Should push elements back to stack1 after popping

D. Should use Peek() instead of Pop()

Solution

1. Step 1: Understand dequeue logic

   After transferring elements from stack1 to stack2, dequeue should pop from stack2 to maintain correct order.

2. Step 2: Identify wrong pop call

   The code incorrectly pops from stack1 instead of stack2 after transfer.

3. Final Answer:

   Should pop from stack2, not stack1, after transfer -> Option A

4. Quick Check:

   Pop from stack2 after transfer [OK]

Hint: Pop from second stack after transfer for dequeue [OK]

Common Mistakes:

• Popping from wrong stack after transfer
• Not checking if stacks are empty
• Using Peek() instead of Pop() for dequeue

5. You want to implement a queue using two stacks where Enqueue is O(1) time and Dequeue is amortized O(1). Which approach is best?

hard

A. Push elements to stack2 on enqueue; pop from stack1 on dequeue

B. Push elements alternately to stack1 and stack2 on enqueue; pop from stack1 on dequeue

C. Push elements to stack1 on enqueue; pop from stack1 on dequeue without transfer

D. Push all elements to stack1 on enqueue; transfer to stack2 only when stack2 is empty during dequeue

Solution

1. Step 1: Understand enqueue O(1) requirement

   Enqueue should just push to stack1 without extra operations for O(1) time.

2. Step 2: Understand dequeue amortized O(1)

   Dequeue transfers elements from stack1 to stack2 only when stack2 is empty, making transfers infrequent and amortized O(1).

3. Step 3: Evaluate options

   Push all elements to stack1 on enqueue; transfer to stack2 only when stack2 is empty during dequeue matches this approach; others do not maintain correct order or time complexity.

4. Final Answer:

   Push all elements to stack1 on enqueue; transfer to stack2 only when stack2 is empty during dequeue -> Option D

5. Quick Check:

   Lazy transfer on dequeue gives amortized O(1) [OK]

Hint: Transfer only when needed on dequeue for amortized O(1) [OK]

Common Mistakes:

• Transferring on every enqueue causing O(n) enqueue
• Popping from wrong stack without transfer
• Alternating pushes breaking queue order