Merge Intervals

Problem statement

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cover all the intervals in the input.

Example 1:

Input: intervals = [[1,3],[2,6],[8,10],[15,18]]Output: [[1,6],[8,10],[15,18]]Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6].

Example 2:

Input: intervals = [[1,4],[4,5]]Output: [[1,5]]Explanation: Intervals [1,4] and [4,5] are considered overlapping.

Constraints:

• 1 <= intervals.length <= 104
• intervals[i].length == 2
• 0 <= starti <= endi <= 104

My solution

/**
 * @param {number[][]} intervals
 * @return {number[][]}
 */
var merge = function(intervals) {
    return intervals
        .sort((a, b) => a[0] - b[0])
        .reduce((acc, curr) => {
            if (acc.length === 0) {
                acc.push(curr)
                return acc;
            }
        
            let prevAcc = acc[acc.length - 1];
            if (prevAcc[1] >= curr[0] && curr[0] >= prevAcc[0]) {
                acc[acc.length - 1] = [Math.min(prevAcc[0], curr[0]), Math.max(prevAcc[1], curr[1])]
            } else {
                acc.push(curr)
            }
        
            return acc;
            
        }, [])
};