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 challengesMerge the Convoys

Gamified challenge · Two pointers

Merge the Convoys

a and b are the truck numbers of two convoys, each sorted from smallest to largest (numbers can repeat and can be negative). At the junction they become one line that must also be sorted.

Write merge(a, b) that returns the merged line with every truck from both convoys. Since both are sorted, you only ever need to compare the two trucks at the front. Either convoy may be empty.

For a = [1, 3, 5, 7] and b = [2, 4, 6] the answer is [1, 2, 3, 4, 5, 6, 7].

Sign in to play Merge the Convoys

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