← Back to All Algorithms

📅 Activity Selection (Greedy)

Problem

Select the maximum number of non-overlapping activities.

Greedy Choice: Always pick the activity that finishes earliest!

This leaves maximum room for remaining activities.

Activity Timeline

Activities sorted by finish time. Click "Start" to select!