Executable Program With Edge Cases | Dataford Interview Questions

Write a fully executable program to solve a given algorithmic problem, handling all corner cases.

Implement merge_intervals(intervals). The input is a list of closed integer intervals [start, end]; return a new list with every overlapping interval merged. Intervals that only touch, such as [1, 2] and [3, 4], remain separate. Return the result sorted by start value.

Constraints

0 <= intervals.length <= 1000
Each interval contains exactly two integers, start and end
start <= end for every interval
-10^9 <= start <= end <= 10^9
Intervals are closed, and intervals that only touch remain separate

Function Signature

def merge_intervals(intervals):

Your question is Executable Program With Edge Cases. 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

Write a fully executable program to solve a given algorithmic problem, handling all corner cases.

Constraints

0 <= intervals.length <= 1000
Each interval contains exactly two integers, start and end
start <= end for every interval
-10^9 <= start <= end <= 10^9
Intervals are closed, and intervals that only touch remain separate

Function Signature

def merge_intervals(intervals):

Your question is Executable Program With Edge Cases. 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.