DSA Practice
Description
Merge Intervals
Given an array of `intervals` where `intervals[i] = [starti, endi]`, merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input. Example: Input: `intervals = [[1,3],[2,6],[8,10],[15,18]]` Output: `[[1,6],[8,10],[15,18]]`
Progress Tracker
Requirements
Time complexity: O(n log n) due to sorting.
Space complexity: O(n) for the output list.
Sort the intervals by their start time first.
Strategic Hints
Test Execution
Awaiting execution...