GamifiedGamified challengesPracticeRaceLeaderboardPricing

Learn data structures by watching them move, then doing it yourself. Press M anytime to toggle sound.

A product of Amypo Technologies, Coimbatore.

Learn

  • All topics
  • Learning path
  • How it works
  • About dotprep

Practice

  • Practice arena
  • Daily challenge
  • Gamified challenges
  • Race mode
  • Leaderboard

Interview prep

  • Java interview
  • Coding questions
  • Company questions
  • System design
  • Jobs & careers

You

  • Dashboard
  • Settings
  • Pricing
  • Create account

© 2026 dotprep

Content last updated 20 November 2026

GamifiedGamified challengesPracticeRaceLeaderboardPricing
Log inStart free
Gamified challengesK Conveyor Merge

Gamified challenge · Min-heap

K Conveyor Merge

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]`.

Sign in to play K Conveyor Merge

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

or log in with email · create an account