K-Flip Challenge: Reverse First K Elements

📋 OBJECTIVE

Reverse the first K elements of a queue using a stack, then rotate the remaining elements to the back.

📝 ALGORITHM

function reverseK(queue, k) {
  // Step 1: Remove first K
  // Push to stack
  for (i = 0; i < k; i++) {
    stack.push(queue.remove());
  }
  
  // Step 2: Pop stack
  // Enqueue back
  while (!stack.empty()) {
    queue.add(stack.pop());
  }
  
  // Step 3: Rotate n-k
  for (i = 0; i < n-k; i++) {
    queue.add(queue.remove());
  }
}

🔄 FLIP STATION Configure K and start flipping!

Dequeue K → Stack

Pop Stack → Enqueue

Rotate (n-k) items

📥 QUEUE

← FRONT BACK →

⇄

📚 STACK

↑ TOP

K Value: (1 ≤ K ≤ Queue Size)

🔄 K-FLIP CHALLENGE

Success!