Implement Stack Using Queue in DSA C# - Build from Scratch

Implement Stack Using Queue

📖 Scenario: Imagine you have a stack of books but only a queue (a line) to organize them. You want to use the queue to behave like a stack, where the last book you put in is the first one you take out.

🎯 Goal: Build a stack using a single queue in C#. You will write code to add items to the stack and remove the top item, all using queue operations.

📋 What You'll Learn

Create a queue of integers called queue

Create a method Push(int x) to add an element to the stack using the queue

Create a method Pop() to remove and return the top element of the stack using the queue

Print the state of the queue after pushing elements and after popping the top element

💡 Why This Matters

🌍 Real World

Sometimes hardware or libraries only provide queue operations, but you need stack behavior. This technique helps adapt one data structure to behave like another.

💼 Career

Understanding how to implement one data structure using another is a common interview question and shows problem-solving skills in software engineering.

1

Create the queue

Create a queue of integers called queue using Queue<int>.

DSA C#

// Create a queue of integers called queue
// Your code here

Hint

Use Queue<int> to create the queue variable named queue.

2

Add the Push method

Add a static method Push(int x) that adds the integer x to the queue using queue.Enqueue(x).

DSA C#

using System;
using System.Collections.Generic;

class Program
{
    static Queue queue = new Queue();

    static void Push(int x)
    {
        // Add x to the queue
        // Your code here
    }

    static void Main()
    {
    }
}

Hint

Use queue.Enqueue(x) inside the Push method to add the element.

3

Add the Pop method with rotation

Add a static method Pop() that removes and returns the last pushed element from queue. Use a loop to dequeue and enqueue elements except the last one, then dequeue and return the last element.

DSA C#

using System;
using System.Collections.Generic;

class Program
{
    static Queue queue = new Queue();

    static void Push(int x)
    {
        queue.Enqueue(x);
    }

    static int Pop()
    {
        // Rotate the queue to move last element to front
        // Your code here
    }

    static void Main()
    {
    }
}

Hint

Use a for loop to dequeue and enqueue all elements except the last, then dequeue and return the last element.

4

Push elements, pop top, and print queue

In Main(), push 10, 20, and 30 using Push. Then pop the top element using Pop() and print it. Finally, print the remaining elements in queue separated by spaces.

DSA C#

using System;
using System.Collections.Generic;

class Program
{
    static Queue queue = new Queue();

    static void Push(int x)
    {
        queue.Enqueue(x);
    }

    static int Pop()
    {
        int size = queue.Count;
        for (int i = 0; i < size - 1; i++)
        {
            int val = queue.Dequeue();
            queue.Enqueue(val);
        }
        return queue.Dequeue();
    }

    static void Main()
    {
        // Push 10, 20, 30
        // Pop top element and print it
        // Print remaining elements in queue separated by spaces
        // Your code here
    }
}

Hint

Call Push three times, then Pop once and print the result. Then print all remaining queue elements separated by spaces.

Practice

1. What is the main idea behind implementing a stack using a queue?

easy

A. Use a linked list directly to implement stack

B. Use one queue and reorder elements to simulate stack behavior

C. Use two stacks to simulate queue behavior

D. Use an array to simulate queue behavior

Solution

1. Step 1: Understand stack and queue behavior

   A stack follows Last-In-First-Out (LIFO), while a queue follows First-In-First-Out (FIFO).

2. Step 2: Simulate stack using queue

   By reordering elements in a single queue after each push, the newest element is always at the front, simulating stack pop behavior.

3. Final Answer:

   Use one queue and reorder elements to simulate stack behavior -> Option B

4. Quick Check:

   Stack via queue = reorder elements [OK]

Hint: Remember stack is LIFO, queue is FIFO; reorder queue to mimic stack [OK]

Common Mistakes:

• Confusing stack and queue order
• Using two stacks instead of queues
• Ignoring element reordering after push

2. Which of the following is the correct C# syntax to declare a queue of integers?

easy

A. Queue<int> queue = new Queue<int>();

B. Queue queue = new Queue<int>();

C. Queue<int> queue = Queue<int>();

D. Queue<int> queue = new Queue();

Solution

1. Step 1: Review C# generic queue declaration

   In C#, a generic queue is declared as Queue<T> with new keyword and parentheses.

2. Step 2: Check each option

   Queue<int> queue = new Queue<int>(); correctly uses Queue<int> queue = new Queue<int>(); which is valid syntax.

3. Final Answer:

   Queue<int> queue = new Queue<int>(); -> Option A

4. Quick Check:

   Generic queue syntax = Queue<int> queue = new Queue<int>(); [OK]

Hint: Use new Queue<int>() to declare generic queue in C# [OK]

Common Mistakes:

• Omitting new keyword
• Missing generic type in constructor
• Using non-generic Queue without type

3. What will be the output of the following C# code implementing stack using one queue?

var stack = new StackUsingQueue();
stack.Push(10);
stack.Push(20);
stack.Push(30);
Console.WriteLine(stack.Pop());
Console.WriteLine(stack.Pop());

medium

A. 10\n30

B. 10\n20

C. 20\n30

D. 30\n20

Solution

1. Step 1: Understand push operation in stack using queue

   Each push adds element and reorders queue so last pushed is at front.

2. Step 2: Trace pop operations

   First pop returns 30 (last pushed), second pop returns 20 (second last pushed).

3. Final Answer:

   30\n20 -> Option D

4. Quick Check:

   Stack pop order = last in first out = 30, then 20 [OK]

Hint: Pop returns last pushed element due to queue reorder [OK]

Common Mistakes:

• Assuming queue FIFO order for pop
• Mixing push and pop order
• Ignoring reorder after push

4. Identify the potential issue in this C# method for stack push using one queue:

public void Push(int x) {
    queue.Enqueue(x);
    for (int i = 0; i < queue.Count - 1; i++) {
        queue.Enqueue(queue.Dequeue());
    }
}

medium

A. Enqueue should be Dequeue

B. Missing return statement

C. Using queue.Count in loop condition changes during iteration

D. Loop should run queue.Count times

Solution

1. Step 1: Analyze loop condition with queue.Count

   queue.Count changes momentarily during iteration (decreases after Dequeue, restores after Enqueue).

2. Step 2: Explain why this is a concern

   Although the size restores before the next condition check and works correctly, using a changing value in the loop condition can be confusing and is bad practice. Store count beforehand: int n = queue.Count; for(int i=0; i < n-1; i++)...

3. Final Answer:

   Using queue.Count in loop condition changes during iteration -> Option C

4. Quick Check:

   Loop count must be stored before loop [OK]

Hint: Store queue.Count before loop to avoid changing condition [OK]

Common Mistakes:

• Using dynamic queue.Count in loop condition
• Not rotating queue elements correctly
• Confusing enqueue and dequeue operations

5. You want to implement a stack using two queues. Which approach correctly simulates the stack's pop operation?

hard

A. Push elements into queue1; for pop, move all but last from queue1 to queue2, dequeue last from queue1, then swap queues

B. Push elements into queue2; for pop, dequeue directly from queue2

C. Push elements into queue1; pop by dequeuing from queue1 without moving elements

D. Push elements into queue2; for pop, move all elements to queue1 and dequeue first

Solution

1. Step 1: Understand two-queue stack implementation

   One queue holds elements; pop requires removing last pushed element, which is at the end.

2. Step 2: Describe correct pop operation

   Move all but last element from queue1 to queue2, dequeue last from queue1 (stack pop), then swap queues for next operations.

3. Final Answer:

   Push elements into queue1; for pop, move all but last from queue1 to queue2, dequeue last from queue1, then swap queues -> Option A

4. Quick Check:

   Pop = move all but last, dequeue last, swap queues [OK]

Hint: Pop by moving all but last element, then dequeue last [OK]

Common Mistakes:

• Dequeuing directly without moving elements
• Not swapping queues after pop
• Confusing which queue holds elements