LeetCode Medium Complexity Solution | Dataford Interview Questions

Airbyte may represent scheduled sync windows as inclusive integer intervals. Given a list of sync windows, merge every pair of overlapping or directly adjacent windows and return the resulting non-overlapping intervals.

Formal Specification

Implement merge_sync_windows(windows). The input windows is a list of two-element lists, where [start, end] represents an inclusive interval with start <= end. Return a list of two-element lists sorted by start time. The output must contain the minimum number of intervals that cover exactly the same integer points as the input.

Intervals overlap when the next start is less than or equal to the current end plus one. For example, [1, 3] and [4, 6] are merged because they are adjacent.

Constraints

0 <= windows.length <= 10^4
-10^9 <= start <= end <= 10^9
Each interval contains exactly two integers
The result must be sorted by interval start

Function Signature

def merge_sync_windows(windows):

Your question is LeetCode Medium Complexity Solution. 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