Given N intervals, each starting at s[i] and ending at e[i]. We need to select the largest set of possible intervals that are non-overlapping.
The optimal algorithm i
