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.
That's what I needed to get testcase 8 and 9 from timing out. It's faster because you only need to delete from the end of the queue and checking existence for a set is much faster than checking a list (although takes more memory).
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
QHEAP1
You are viewing a single comment's thread. Return to all comments →
That's what I needed to get testcase 8 and 9 from timing out. It's faster because you only need to delete from the end of the queue and checking existence for a set is much faster than checking a list (although takes more memory).