Interval Scheduling

Question

Suppose you are given a list of lectures with there start time and end times. How can you choose the maximum number of non-overlapping lectures?

Answer 1

1. Sort by end times
2. Take the lecture that ends first.
3. Remove all lectures that conflict (overlap) with it.
4. Then, start again (recurse)

Answer 2

Sort the given intervals based on their end times. This is crucial to ensure that you are considering intervals that end earliest first. Start with the first interval and consider it as part of the solution. Iterate through the sorted intervals.

For each interval, check if its start time is greater than or equal to the end time of the last selected interval. If it is, add it to the solution. Maintain a count of the selected intervals. The count represents the maximum number of non-overlapping intervals.