Walk Through Your Online Assessment Solution | Dataford Interview Questions

Walk through and explain your online assessment solution.

Asked in the OA review round stage. This was a separate interview dedicated to the Codility submission.

For the implementation portion, use merge_intervals(intervals). Given a list of inclusive integer intervals, return a new list with all overlapping or touching intervals merged. Explain the algorithm, correctness, complexity, and edge cases.

Input: A list of [start, end] pairs.

Output: A list of merged intervals sorted by start value.

Constraints

0 <= len(intervals) <= 10^4
Each interval has exactly two integer values
start <= end for every interval
Touching intervals must be merged
The returned intervals must be sorted by start value

Function Signature

def merge_intervals(intervals):

Your question is Walk Through Your Online Assessment Solution. 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