Implement Queue Using Two Stacks: Optimal Java Solution

A common coding interview problem demonstrates how to implement a queue using only stack operations. The optimal approach uses two stacks to achieve amortized O(1) time for push and pop operations. The solution reverses element order by transferring from one stack to another only when the output stack is empty.