Merge intervals

Also written: pattern 13

Combining overlapping time slots by sorting them by start and joining each slot to the last one when `start <= last.end`. It costs O(n log n).