Intervals appear in:
- meetings
- bookings
- time ranges

## Merge intervals
```python
def merge(ints):
    ints.sort()
    res = [ints[0]]
    for s, e in ints[1:]:
        last = res[-1]
        if s <= last[1]:
            last[1] = max(last[1], e)
        else:
            res.append([s, e])
    return res

print(merge([[1,3],[2,6],[8,10]]))
```

## Graph
```mermaid
flowchart LR
  A[1-3] --> B[2-6]
  B --> C[Merged 1-6]
```

## Remember
- sort first
- then merge overlaps


Handle overlapping intervals using sorting and merging patterns, common in scheduling and timelines.

Interval Structures

Master fundamental data structures and their implementations.

Interval Structures

Merge intervals ```python def merge(ints): ints.sort() res = [ints[0]] for s, e in ints[1:]: last = res[-1] if s <= last[1]: last[1] = max(last[1], e) else: res.append([s, e]) return res

Graph ```mermaid flowchart LR A[1-3] --> B[2-6] B --> C[Merged 1-6] ```

Remember - sort first - then merge overlaps

More on Data Structures

Data Structures Intro

Big O Basics

List Fundamentals