Domanda di colloquio di Twin Health
Merge K sorted array list.
Risposta di colloquio
Anonimo
9 ago 2022
I was able to solve it using minHeap priority queue with runtime : O(n*mlog(n * m)) and space : O(n*m) Expected time complexity was : O(N Log k)
Merge K sorted array list.
Anonimo
I was able to solve it using minHeap priority queue with runtime : O(n*mlog(n * m)) and space : O(n*m) Expected time complexity was : O(N Log k)