Q:Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).

Learn the most efficient way to use one array to implement both a stack and a queue, two common data structures for algorithms. See a code example in Java.

Implement-Queue-using-Stacks Implement a first in first out (FIFO) queue using only two stacks. The implemented queue should support all the functions of a normal queue (push, peek, pop, and empty).