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.
Uh, Insertion in queue takes O(1) time, but according to your solution, insertion takes O(n) time since we need to transfer n elements from 'Rear' stack to 'Front' stack before insertion.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Queue using Two Stacks
You are viewing a single comment's thread. Return to all comments →
Uh, Insertion in queue takes O(1) time, but according to your solution, insertion takes O(n) time since we need to transfer n elements from 'Rear' stack to 'Front' stack before insertion.