We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Idea is to use 1 stack for enqueue operations (old stack)
When performing dequeue, if new stack is empty(this is important), copy the old stack on the new stack and then perform pop on the new stack. Same goes for Front operation : )
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Queues: A Tale of Two Stacks
You are viewing a single comment's thread. Return to all comments →
Idea is to use 1 stack for enqueue operations (old stack)
When performing dequeue, if new stack is empty(this is important), copy the old stack on the new stack and then perform pop on the new stack. Same goes for Front operation : )