Algorithm

A queue works on FIFO (First-In-First-Out) principle, but to reverse it, we want LIFO (Last-In-First-Out) behavior. The easiest way to get LIFO is by using a stack. We can dequeue every element from the queue and push it into a stack. Since a stack pops elements in reverse order, we can then pop each element from the stack and enqueue it back into the queue giving us the reversed order. This method is straightforward and leverages the stack’s natural reversing property.

Initialize an empty stack.
While the queue is not empty, remove the front element and push it onto the stack.
Once all elements are in the stack, pop them one by one and add them back to the queue.
The queue will now be reversed.
Return the modified queue.