Pure Coding Question | Dataford Interview Questions

it was purely coding question

Given a list of integer intervals, merge every pair of overlapping intervals and return the resulting non-overlapping intervals sorted by start time. Touching intervals, such as [1, 3] and [3, 5], are considered overlapping.

Function signature: def merge_intervals(intervals): Input is a list of two-element lists. Return a list of merged two-element lists.

Constraints

0 <= intervals.length <= 10^4
Each interval contains exactly two integers
intervals[i][0] <= intervals[i][1]
-10^9 <= intervals[i][0], intervals[i][1] <= 10^9

Function Signature

def merge_intervals(intervals):

Your question is Pure Coding Question. 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

it was purely coding question

Function signature: def merge_intervals(intervals): Input is a list of two-element lists. Return a list of merged two-element lists.

Constraints

0 <= intervals.length <= 10^4
Each interval contains exactly two integers
intervals[i][0] <= intervals[i][1]
-10^9 <= intervals[i][0], intervals[i][1] <= 10^9

Function Signature

def merge_intervals(intervals):

Your question is Pure Coding Question. 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.