Day 18 – Greedy Algorithms

1. N Meetings in One Room Problem: Given start[] and end[] times of meetings, find the maximum number of meetings that can be held in one room where only one meeting can happen at a time. Intuition: Sort meetings by end time. Always pick the meeting ...