Palantir Technologies Interview Question
Given a max-heap, how do I find the top k items?
Interview Answer
Anonymous
Apr 18, 2013
Simply remove the root node k times, takes k*log(n) time. Haha I blurted out log(k), derpin' since '93
Given a max-heap, how do I find the top k items?
Anonymous
Simply remove the root node k times, takes k*log(n) time. Haha I blurted out log(k), derpin' since '93
Check out your Company Bowl for anonymous work chats.