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.
In C++, I solved it by heapifying only the list after the position at which the element was removed instead of heapifying it from beginning. Was enough time saved to pass all the tests.
QHEAP1
You are viewing a single comment's thread. Return to all comments →
In C++, I solved it by heapifying only the list after the position at which the element was removed instead of heapifying it from beginning. Was enough time saved to pass all the tests.