Gamified challenge · Min-heap
belts[b] lists the box numbers on conveyor belt b, front first, in non-decreasing order. A belt may be empty, and there may be no belts at all.
Write mergeK(belts) (Python merge_k(belts)) that returns every box from every belt as one list in non-decreasing order. Equal boxes are interchangeable, so the answer is unique.
Example: [[1, 4, 5], [1, 3, 4], [2, 6]] → `[1, 1, 2, 3, 4, 4, 5, 6]`.
This game is part of the paid plans. Sign in, then pick a plan to write your answer, watch it play out, and step through the algorithm with its guide.
Sign in with Google