Find the Kth largest number in an array.

Question

wmt · Accepted Answer

Create a min heap of size k.   Iterate down the list.  If element is larger than  the min number in min heap, replace the min heap's min element with it.   Time complexity is O(k log k + n + n  log k) worse case.  Space complexity is O(n+k)

Anonimo · Answer

Multiple approaches - efficient one is maintaining the K elements max heap.
other are modified quick sort and brute force.

Rakuten

Domanda di colloquio di Rakuten

Risposte di colloquio

Aziende seguite

Ricerche di lavoro