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 challengesInversion Counter Line

Gamified challenge · Divide and conquer

Inversion Counter Line

line[i] is the bib number of the runner in place i. The marshal sorts the line into non-decreasing order using only swaps of two neighbouring runners, and never swaps two runners with equal bibs.

Write inversions(line) that returns the fewest neighbour swaps needed. That is the number of pairs i < j with line[i] > line[j]. Lines can hold over a thousand runners, so aim for O(n log n).

Example: [2, 4, 1, 3, 5] has the out-of-order pairs (2, 1), (4, 1) and (4, 3), so the answer is 3.

Sign in to play Inversion Counter Line

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