We are given an array of closed intervalsclosedintervals called intervals, where each interval has a start time and an end time and is represented as intervals[i] = [starti, endi]. Your task is to merge all the overlapping intervalsOverlapping intervals are two or more intervals with at least one common point in time. and return an array of the resulting non-overlapping intervals that cover all the intervals in the input.

Constraints:

• $1 \leq$ intervals.length $\leq10^3$

• intervals[i].length $== 2$

• $0\leq$ starti $\leq$ endi $\leq10^4$

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.