You are given a $0$ indexed $2 ext{D}$ integer array paint of length $n$, where paint[i] = [start_i, end_i] indicates that on the $i^{ ext{th}}$ day, you need to paint the continuous interval from start_i to end_i.

Any portion of the interval that has already been painted on previous days should not be painted again.

Return an array result of length $n$, where result[i] represents the total amount of new, unpainted area painted on the $i^{ ext{th}}$ day.

Constraints:

• $1 \leq$ paint.length $\leq 10^5$

• paint[i].length $= 2$

• $0 \leq$ start_i $<$ end_i $\leq 5 imes 10^4$

Now, 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.