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.
I haven't worked it out, but possibly. If you wrote upheap and downheap functions that take an array and boundary values, you could treat the first half as the max heap and the second half as the min heap. It would be very complicated though
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Heaps: Find the Running Median
You are viewing a single comment's thread. Return to all comments →
I haven't worked it out, but possibly. If you wrote upheap and downheap functions that take an array and boundary values, you could treat the first half as the max heap and the second half as the min heap. It would be very complicated though