Sort by start; merge overlapping neighbors.
After sorting, keep a result list. If current interval overlaps last, extend end; else append.
Sort by start; merge overlapping neighbors.
After sorting, keep a result list. If current interval overlaps last, extend end; else append.