Pergunta de entrevista da empresa Spotify

Kth greatest element

Respostas da entrevista

Sigiloso

26 de fev. de 2018

sorting, but they wanted something faster, with a heap (which I forgot about) that can be built in O(n) time.

Sigiloso

27 de fev. de 2019

Minheap with size k. Time comp: nlogk