28. Merge Intervals

func merge(intervals [][]int) [][]int {
    slices.SortFunc(intervals, func(a, b []int) int {
        return a[0] - b[0]
    })

    result := [][]int{}
    currentLeft, currentRight := intervals[0][0], intervals[0][1]

    for i := 1; i < len(intervals); i++ {
        if intervals[i][0] <= currentRight {
            currentRight = max(currentRight, intervals[i][1])
        } else {
            result = append(result, []int{currentLeft, currentRight})
            currentLeft = intervals[i][0]
            currentRight = intervals[i][1]
        }
    }
    result = append(result, []int{currentLeft, currentRight})

    return result
}