A interval is usually represented as pairs, representing a range, often in time or space:

type Interval struct {
    Start int
    End   int
}

Core Tools

Calendar apps: Scheduling, merging, overlaps
Booking systems: Avoiding double bookings
Video editing: Overlaying intervals for effects
Memory allocation: Avoiding overlapping memory regions
Database range queries: Time intervals for availability

By Sorting-by-start, discovering overlapping intervals is only compare intervalA.End with intervalB.Start.

sort.Slice(intervals, func(i, j int) bool {
    return intervals[i].Start < intervals[j].Start
})

If you're trying to greedily pick the earliest finishing intervals

Complexity Patterns

Problem Type	Time Complexity	Space Complexity
Merge Intervals	`O(n log n)` (sort)	`O(n)`
Insert Interval	`O(n)`	`O(n)`
Max Non-overlapping Intervals	`O(n log n)` (sort)	`O(1)`
Interval Intersections	`O(n + m)`	`O(min(n, m))`