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 challengesCourse Planner

Gamified challenge · Topological sort

Course Planner

There are n courses numbered 0 to n - 1. Each rule prereqs[i] = [a, b] says course a must be taken before course b. Rules may repeat.

Write order(n, prereqs) that returns a list of all n courses, each exactly once, in which every course comes after all of its prerequisites. Any valid order passes. If the rules loop (for example 0 before 1, 1 before 2, 2 before 0), no order exists: return an empty list.

Example: n = 4, prereqs = [[0, 1], [0, 2], [1, 3], [2, 3]] → [0, 1, 2, 3] (or [0, 2, 1, 3]).

Sign in to play Course Planner

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