Pergunta de entrevista da empresa X

Nothing unexpected

Resposta da entrevista

Sigiloso

3 de jan. de 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