Stack Queue Forge: Adapter Puzzle

📋 OBJECTIVE

Implement a Queue using only two Stacks! Choose between add-efficient or remove-efficient modes.

📝 ADD-EFFICIENT

// ADD: O(1)
function add(x) {
  stack1.push(x);
}

// REMOVE: O(n)
function remove() {
  // Transfer all to stack2
  while (!stack1.empty()) {
    stack2.push(stack1.pop());
  }
  result = stack2.pop();
  // Transfer back
  while (!stack2.empty()) {
    stack1.push(stack2.pop());
  }
  return result;
}

📝 REMOVE-EFFICIENT

// ADD: O(n)
function add(x) {
  // Transfer to stack2
  while (!stack1.empty()) {
    stack2.push(stack1.pop());
  }
  stack1.push(x);
  // Transfer back
  while (!stack2.empty()) {
    stack1.push(stack2.pop());
  }
}

// REMOVE: O(1)
function remove() {
  return stack1.pop();
}

⚒️ FORGE WORKSHOP Choose a mode and start operating!

Current Mode: ADD-Efficient

STACK 1

↓ TOP

⇆

Transfer Zone
(Reverses order!)

STACK 2

↓ TOP

📤 DEQUEUED ITEMS (FIFO ORDER)

No items dequeued yet...

⚒️ STACK QUEUE FORGE

Success!