Implement Stack Using Queue in DSA Go - Build from Scratch

Implement Stack Using Queue

📖 Scenario: You are building a simple stack data structure but only have a queue available. A stack works like a stack of plates: last plate added is the first one removed (Last In First Out). A queue works like a line at a store: first person in line is the first served (First In First Out).Your task is to use a queue to create a stack that can push (add) and pop (remove) elements in stack order.

🎯 Goal: Create a stack using a single queue in Go. You will write code to add elements to the stack and remove the top element, using only queue operations.

📋 What You'll Learn

Create a queue using Go slices

Implement a push function to add elements to the stack

Implement a pop function to remove the top element from the stack

Use only one queue to simulate stack behavior

💡 Why This Matters

🌍 Real World

Stacks are used in undo features, expression evaluation, and backtracking algorithms. Queues are common in scheduling and buffering. Understanding how to build one data structure from another deepens your grasp of data organization.

💼 Career

Many software engineering roles require knowledge of data structures. Implementing a stack using a queue shows your problem-solving skills and understanding of fundamental concepts.

1

Create an empty queue

Create a variable called queue as an empty slice of integers.

DSA Go

# Create an empty queue as a slice of int
# Your code here

Hint

Use queue := []int{} to create an empty slice of integers.

2

Add a helper variable for queue length

Add a variable called n that stores the length of queue using len(queue).

DSA Go

package main

import "fmt"

func main() {
    queue := []int{}
    // Add variable n to store length of queue
    // Your code here
}

Hint

Use n := len(queue) to get the number of elements in the queue.

3

Implement push operation using queue

Write a function called push that takes a pointer to queue and an integer x. It should append x to queue and then rotate the queue so that x is at the front, simulating stack push behavior.

DSA Go

package main

import "fmt"

func main() {
    queue := []int{}
    n := len(queue)

    // Define push function here
    // Your code here
}

Hint

Append x to the queue, then move all elements before x to the back to bring x to the front.

4

Implement pop operation and print result

Write a function called pop that removes and returns the front element of queue. Then in main, push 10, 20, 30 onto queue using push, pop the top element using pop, and print the remaining queue slice.

DSA Go

package main

import "fmt"

func push(queue *[]int, x int) {
    *queue = append(*queue, x)
    n := len(*queue)
    for i := 0; i < n-1; i++ {
        front := (*queue)[0]
        *queue = (*queue)[1:]
        *queue = append(*queue, front)
    }
}

// Define pop function here
// Your code here

func main() {
    queue := []int{}
    push(&queue, 10)
    push(&queue, 20)
    push(&queue, 30)
    // Pop top element
    // Print queue
    // Your code here
}

Hint

Pop removes the front element (top of stack). After pushing 10, 20, 30, popping removes 30. Remaining queue should be [20 10].

Practice

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

easy

A. Use one or two queues to simulate Last-In-First-Out (LIFO) behavior

B. Use a queue to store elements in sorted order

C. Use a stack to simulate First-In-First-Out (FIFO) behavior

D. Use two stacks to implement a queue

Solution

1. Step 1: Understand stack and queue behaviors

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

2. Step 2: Simulate stack using queue(s)

   To implement a stack using queue(s), we use one or two queues to reorder elements so the last pushed element is always dequeued first.

3. Final Answer:

   Use one or two queues to simulate Last-In-First-Out (LIFO) behavior -> Option A

4. Quick Check:

   Stack = LIFO simulated by queue(s) [OK]

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

Common Mistakes:

• Confusing stack and queue order
• Trying to sort elements instead of reordering
• Using stack to implement queue instead

2. Which of the following is the correct Go syntax to declare a queue using a slice of integers?

easy

A. var queue []int

B. queue := make(map[int]int)

C. queue := []string{}

D. var queue int

Solution

1. Step 1: Identify queue data structure type

   A queue can be implemented using a slice of integers for integer elements.

2. Step 2: Check Go syntax for slice declaration

   "var queue []int" declares a slice of integers, suitable for queue implementation.

3. Final Answer:

   var queue []int -> Option A

4. Quick Check:

   Slice of int = queue [OK]

Hint: Use slice []int for queue of integers in Go [OK]

Common Mistakes:

• Using map instead of slice for queue
• Declaring wrong data type for queue
• Using string slice for integer queue

3. Consider this Go code snippet implementing push operation of stack using one queue:

func (s *Stack) Push(x int) {
    s.q = append(s.q, x)
    for i := 0; i < len(s.q)-1; i++ {
        s.q = append(s.q, s.q[0])
        s.q = s.q[1:]
    }
}

If initially s.q = [1, 2], what is s.q after calling Push(3)?

medium

A. [3, 2, 1]

B. [1, 2, 3]

C. [3, 1, 2]

D. [2, 1, 3]

Solution

1. Step 1: Append new element 3 to queue

   Initial queue: [1, 2]. After append: [1, 2, 3].

2. Step 2: Rotate queue elements to move 3 to front

   Loop runs len(s.q)-1 = 2 times: - Iteration 1: append s.q[0]=1, queue becomes [1, 2, 3, 1], then remove first element: [2, 3, 1] - Iteration 2: append s.q[0]=2, queue becomes [2, 3, 1, 2], then remove first element: [3, 1, 2]

3. Final Answer:

   [3, 1, 2] -> Option C

4. Quick Check:

   Push moves new element front: [3,1,2] [OK]

Hint: New push rotates queue to front [OK]

Common Mistakes:

• Not rotating queue after append
• Removing wrong elements during rotation
• Confusing order of elements after push

4. This Go code tries to implement Pop operation for stack using one queue:

func (s *Stack) Pop() int {
    if len(s.q) == 0 {
        return -1
    }
    val := s.q[0]
    s.q = s.q[1:]
    return val
}

What is the bug in this Pop method?

medium

A. It returns -1 when queue is empty, should panic instead

B. It removes the last element instead of the first

C. It does not check if queue is nil before accessing

D. It removes the front element, but stack pop should remove the last pushed element

Solution

1. Step 1: Understand Pop operation in stack

   Pop removes the last pushed element (top of stack).

2. Step 2: Analyze given Pop code

   Code removes s.q[0], the front of queue, which is incorrect because stack top is at front only if queue is rotated properly.

3. Final Answer:

   It removes the front element, but stack pop should remove the last pushed element -> Option D

4. Quick Check:

   Pop must remove last pushed, not front [OK]

Hint: Pop must remove top, not front element [OK]

Common Mistakes:

• Removing front element without rotation
• Ignoring empty queue check
• Returning wrong default value

5. You want to implement a stack using two queues q1 and q2 in Go. Which approach correctly implements the Push operation to keep the stack order?

hard

A. Dequeue all elements from q1 to q2, then enqueue new element to q1

B. Enqueue new element to q2, then dequeue all from q1 to q2, swap q1 and q2

C. Enqueue new element to q1 only, no other operations

D. Enqueue new element to q1, then dequeue one element from q2

Solution

1. Step 1: Understand two-queue stack push logic

   To keep stack order, new element must be at front of main queue after push.

2. Step 2: Push by enqueue to empty q2, move all from q1 to q2, then swap

   Enqueue new element to q2, move all q1 elements to q2, then swap q1 and q2 so q1 has new order with new element front.

3. Final Answer:

   Enqueue new element to q2, then dequeue all from q1 to q2, swap q1 and q2 -> Option B

4. Quick Check:

   Push uses q2 enqueue + q1 transfer + swap [OK]

Hint: Push to empty q2, move q1 to q2, swap queues [OK]

Common Mistakes:

• Not swapping queues after transfer
• Enqueueing new element to wrong queue
• Forgetting to move all elements