0PricingLogin
Competitive Programming Academy · Lesson

Activity Selection by Earliest Finish

Schedule the most non-overlapping events.

The Scheduling Problem

Given events with start and end times, activity selection asks for the most events you can attend without any two overlapping. 📅

Overlap Means Conflict

Two activities clash if one starts before the other ends. You can pick only one event from any overlapping pair.

All lessons in this course

  1. The Greedy Mindset
  2. Activity Selection by Earliest Finish
  3. Fractional Knapsack by Ratio
  4. Spot When Greedy Fails
← Back to Competitive Programming Academy