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.
Came to check out discussion after solving the problem exactly using the same technique. The Overall time complexity of this method is almost same as using simple queue for big numbers.
To be exact, enqueue is O(1) and dequeue and print each is O(2). So for n operations the time complexity is O(n).
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 →
Came to check out discussion after solving the problem exactly using the same technique. The Overall time complexity of this method is almost same as using simple queue for big numbers.
To be exact, enqueue is O(1) and dequeue and print each is O(2). So for n operations the time complexity is O(n).