Merge intervals

Question 1

What is the definition of Merge Intervals?

Answer 1

Merges overlapping intervals in a sorted list.

Use Case: Scheduling, overlapping ranges.

Question 2

What are the key steps for Merge Intervals?

Answer 2

1. Sort intervals by start time.
2. Iterate, merge if current start ≤ previous end.
3. Add non-overlapping intervals to result.

Action: Explain steps for Merge Intervals aloud.

Question 3

What is the problem and approach for Merge Intervals?

Answer 3

Problem: Merge overlapping intervals.
Approach: Sort by start, merge if overlapping, keep non-overlapping.

Action: Verbalize solution logic aloud.

Question 4

What are the complexity and gotchas of Merge Intervals?

Answer 4

Complexity: Time: O(n log n), Space: O(n).
Gotchas: Empty list, no overlaps.

Action: List edge cases for Merge Intervals aloud.

Question 5

Provide a visual or code example for Merge Intervals.

Answer 5

```python
from typing import List
def merge(intervals: List[List[int]]) -> List[List[int]]:
if not intervals:
return []
intervals.sort(key=lambda x: x[0])
result = [intervals[0]]
for start, end in intervals[1:]:
if start <= result[-1][1]:
result[-1][1] = max(result[-1][1], end)
else:
result.append([start, end])
return result
~~~