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 challengesActivity Scheduler

Gamified challenge · Greedy choice

Activity Scheduler

Each entry of talks is [start, end] with start < end. A hall can host only one talk at a time, but a talk that ends at time t leaves the hall free for one that starts at t.

Write maxTalks(talks) that returns the largest number of talks the hall can host. For [[0, 10], [1, 2], [3, 4], [5, 6]] the answer is 3: skip the long keynote and run the three short talks.

An empty list hosts 0 talks.

Sign in to play Activity Scheduler

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