[C++ Core] Merge Intervals

Question

Problem Statement for Merge Intervals under C++ Core:

Given an array of intervals where intervals[i] = [start_i, end_i], merge all overlapping intervals.

Input Constraints:
- 1 <= len(nums) <= 10^5
- Elements fit in memory standard spaces.

Accepted Answer

```
def merge(intervals):
    intervals.sort(key=lambda x: x[0])
    merged = []
    for interval in intervals:
        if not merged or merged[-1][1] < interval[0]:
            merged.append(interval)
        else:
            merged[-1][1] = max(merged[-1][1], interval[1])
    return merged
```

[C++ Core] Merge Intervals

Problem Statement

Proposed Solution

Your Progress

Save Progress?