Queue from Two Stacks

Implement queue behavior with an input stack and an output stack.

Algorithm

The replay uses the same three values in every language, so this Go DSA implementation can be compared directly with the rest of the DSA track.

Basic Implementation

basic.go

package main

import (
	"fmt"
	"strings"
)

func render(values []int) string {
	parts := make([]string, 0, len(values))
	for _, value := range values {
		parts = append(parts, fmt.Sprint(value))
	}
	return strings.Join(parts, " -> ")
}

func main() {
	inStack := []int{}
	outStack := []int{}
	for _, value := range []int{10, 20, 30} { inStack = append(inStack, value) }
	for len(inStack) > 0 { outStack = append(outStack, inStack[len(inStack)-1]); inStack = inStack[:len(inStack)-1] }
	removed := []int{}
	for len(outStack) > 0 { removed = append(removed, outStack[len(outStack)-1]); outStack = outStack[:len(outStack)-1] }
	fmt.Println(render(removed))
}

Complexity

Time: O(1) amortized per operation
Space: O(n)

Implementation notes

Keep the explicit stack/queue operations. Library shortcuts that only produce the final list hide the data-structure behavior this lesson is meant to replay.
The final output uses a deterministic a -> b -> c format for cross-language comparison.

input stack Enqueue pushes new values onto the input stack.

output stack When the output stack is empty, transferring all input values reverses them into dequeue order.