Implementing Stacks & Queues

What algorithmic concept is demonstrated by using a stack to reverse a queue?

function reverseQueue(queue) {
  const stack = [];
  while (!queue.isEmpty()) {
    stack.push(queue.dequeue());
  }
  while (stack.length) {
    queue.enqueue(stack.pop());
  }
  return queue;
}

Divide and conquer
Dynamic programming
Data structure conversion
This demonstrates data structure conversion because: 1) Uses stack's LIFO to reverse queue's FIFO, 2) Temporarily converts queue to stack, 3) Leverages complementary data structure properties, 4) Achieves reversal without additional memory, 5) Shows relationship between linear data structures, 6) Common pattern in data structure operations, 7) Efficient O(n) solution, 8) Useful technique for structure manipulation.
Greedy algorithm

Next Question (16/20)