← Questions
Merge k sorted arrays
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Merge several sorted arrays into one sorted array with a min-heap holding one element from each array. Give the O(N log k) cost and compare with pairwise merging.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding