Merge Refresh Windows Intervals | Dataford Interview Questions

Merge overlapping intervals representing source refresh windows and return the minimal set of non-overlapping windows.

Implement merge_refresh_windows(windows). The input is a list of [start, end] integer pairs with start <= end; intervals that touch at an endpoint are considered overlapping. Return a new list of merged [start, end] pairs sorted by start time.

Constraints

0 <= windows.length <= 10^4
Each window contains exactly two integers
start <= end for every window
-10^9 <= start, end <= 10^9
Intervals that touch at an endpoint are merged

Function Signature

def merge_refresh_windows(windows):

Your question is Merge Refresh Windows Intervals. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem

Merge overlapping intervals representing source refresh windows and return the minimal set of non-overlapping windows.

Constraints

0 <= windows.length <= 10^4
Each window contains exactly two integers
start <= end for every window
-10^9 <= start, end <= 10^9
Intervals that touch at an endpoint are merged

Function Signature

def merge_refresh_windows(windows):

Your question is Merge Refresh Windows Intervals. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.