Explain the activity selection problem and its greedy solution.

Given activities with start and finish times, select maximum non-overlapping activities. Greedy approach: sort by finish time, always select the activity that finishes earliest and is compatible with previous selection. This works because finishing early leaves maximum time for remaining activities. Time complexity is O(n log n) for sorting. This problem demonstrates when greedy gives optimal solution - can be proven by exchange argument.