Complete Article: https://tutorialhorizon.com/algorithm...
You have one meeting room at your company. There are N meeting needs to take place. Every meeting has a start time and end time along with the meeting title. Your task is to schedule as many meetings as possible in that conference room with no conflicts.
Example:
Meetings:
A[ Start Time: 1, End Time: 3]
B[ Start Time: 4, End Time: 5]
C[ Start Time: 0, End Time: 7]
D[ Start Time: 6, End Time: 8]
F[ Start Time: 9, End Time: 11]
G[ Start Time: 10, End Time: 12]
Output: A B D F
Meetings:
A[ Start Time: 1, End Time: 3]
B[ Start Time: 2, End Time: 5]
Output: A