Activity Selection

Medium

Activity Selection

Find maximum non-overlapping meetings using greedy algorithm

GreedySortingIntervals

Greedy algorithm makes the locally optimal choice at each step. In activity selection, we always pick the meeting that ends earliest.

1/19

There are 8 meeting requests. Schedule as many non-overlapping meetings as possible in one room!

Medium

Activity Selection

Find maximum non-overlapping meetings using greedy algorithm

GreedySortingIntervals

Greedy algorithm makes the locally optimal choice at each step. In activity selection, we always pick the meeting that ends earliest.

1/19

There are 8 meeting requests. Schedule as many non-overlapping meetings as possible in one room!