Time and Space Complexity Whiteboard | Dataford Interview Questions

Solve a whiteboard coding problem and analyze its time and space complexity. Implement merge_intervals(intervals), which accepts a list of inclusive integer intervals [start, end] and returns a new list containing the merged intervals in ascending start order. Intervals that overlap or touch, such as [1, 3] and [3, 5], must be combined.

Constraints

0 <= intervals.length <= 10^4
Each interval contains exactly two integers, start and end
start <= end for every interval
-10^9 <= start <= end <= 10^9
Intervals must be returned in ascending start order

Function Signature

def merge_intervals(intervals):

Your question is Time and Space Complexity Whiteboard. 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 <= intervals.length <= 10^4
Each interval contains exactly two integers, start and end
start <= end for every interval
-10^9 <= start <= end <= 10^9
Intervals must be returned in ascending start order

Function Signature

def merge_intervals(intervals):

Your question is Time and Space Complexity Whiteboard. 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.