Domanda di colloquio di X
Nothing unexpected
Risposta di colloquio
Anonimo
3 gen 2014
Option 1: Using a Priority Queue (heap). Complexity O(n logk) Option 2: Using Selection algorithm (first finding kth largest element and then sorting the elements
Nothing unexpected
Anonimo
Option 1: Using a Priority Queue (heap). Complexity O(n logk) Option 2: Using Selection algorithm (first finding kth largest element and then sorting the elements