Given an array of intervals windows, where each interval is [start, end] and represents an inclusive time window during which a prototype test was run, merge all overlapping intervals and return the merged result sorted by start time. This is useful for consolidating repeated or adjacent validation runs into the smallest set of continuous test windows.
Example 1:
Input: windows = [[1,3],[2,6],[8,10],[15,18]]
Output: [[1,6],[8,10],[15,18]]
Explanation: [1,3] and [2,6] overlap, so they merge into [1,6].
Example 2:
Input: windows = [[1,4],[4,5]]
Output: [[1,5]]
Explanation: The intervals touch at 4, so they form one continuous window.
1 <= len(windows) <= 10^4windows[i].length == 20 <= start <= end <= 10^9