Given meetings with start and end times, find the maximum number of meetings that can be held in one room.
Here's exactly activity selection with a different story. The greedy strategy is identical: sort by end time, pick greedily. Practice recognizing problems in disguise. Interview questions often reframe classic problems with new context. If you see "non-overlapping" and "maximize," think activity selection. The underlying structure is the same even if the story changes.