Implement a Queue class using two stacks
We used two stacks. All items get pushed and stored on the first stack. Whenever a dequeu needs to happen, we move everything from the first stack to the second and then pop off. Then to keep the correct order, we pop everything back into the first stack.
Big O:
- Time: O(n)
- Space: O(1)
Daniel Dills, Wondwosen Tsige, Prabin Singh, Michael Ryan
