Given a collection of intervals, merge all overlapping intervals and return an array of the non-overlapping intervals that cover all the intervals in the input.
Input
A list of intervals, where each interval is represented as a list of two integers [start, end].
Output
A list of merged intervals, where each interval is represented as a list of two integers.
Constraints
1 <= intervals.length <= 10^4
0 <= intervals[i][0] <= intervals[i][1] <= 10^4
Function Signature
defmerge_intervals(intervals):
Interviewer
Your question is Merge Overlapping Intervals. 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.
