Domanda di colloquio di Spotify
Kth greatest element
Risposte di colloquio
Anonimo
26 feb 2018
sorting, but they wanted something faster, with a heap (which I forgot about) that can be built in O(n) time.
Kth greatest element
Anonimo
sorting, but they wanted something faster, with a heap (which I forgot about) that can be built in O(n) time.