Implement Queue using Stacks at Qualcomm
Easy69.3% acceptance
This problem has 62.5% frequency at Qualcomm.
Problem Description
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`). Implement the `MyQueue` class: * `void push(int x)` Pushes element x to the back of the queue. * `int pop()` Removes...
Read full problem and hintsTopics
Also asked at 10 companies
More Qualcomm Questions
Valid ParenthesesEasyLRU CacheMediumSerialize and Deserialize Binary TreeHardDesign Memory AllocatorMediumFirst Unique Character in a StringEasy
View all Qualcomm questions