Domanda di colloquio di Bloomberg
Coding session: Merge K array(sorted) into big one as sorted.
Risposta di colloquio
Anonimo
11 giu 2023
I asked how to deal with equal. I used priority-queue(heap) Interviewer ask me to clarify my algo ideas before writing them down. Also asked the Time complexity - O( n * log k )