Coding Question for SRE Context | Dataford Interview Questions

Standard coding question for SWE, less common for SRE.

Given a list of integer intervals, merge all overlapping intervals and return the resulting non-overlapping intervals sorted by start time. Implement merge_intervals(intervals), where each interval is represented as [start, end].

Input and Output

The input is a list of intervals. Return a new list containing merged intervals. Intervals that only touch, such as [1, 3] and [3, 5], are considered overlapping.

Constraints

0 <= len(intervals) <= 10^4
Each interval contains exactly two integers
For every interval, start <= end
-10^9 <= start, end <= 10^9
Intervals that touch at an endpoint are considered overlapping

Function Signature

def merge_intervals(intervals):

Your question is Coding Question for SRE Context. 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