Merge Overlapping Time Segments | Dataford Interview Questions

Implement an interval-based greedy algorithm to merge overlapping time segments in a high-frequency system. Accept a list of closed intervals [start, end] and return a new list of merged intervals sorted by start time. Intervals that overlap or touch must be combined, and the input must not be modified.

Constraints

0 <= len(intervals) <= 10^4
Each interval contains exactly two integers, start and end
start <= end for every interval
-10^9 <= start <= end <= 10^9
The input list must not be modified

Function Signature

def merge_segments(intervals):

Your question is Merge Overlapping Time Segments. 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

Constraints

0 <= len(intervals) <= 10^4
Each interval contains exactly two integers, start and end
start <= end for every interval
-10^9 <= start <= end <= 10^9
The input list must not be modified

Function Signature

def merge_segments(intervals):

Your question is Merge Overlapping Time Segments. 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.