You are given an integer length and an array of update operations updates, where each operation is represented as updates[i] = [startIdx$_i$, endIdx$_i$, inc$_i$].

Assume you have an array of size length where every element is initially set to $0$.

For each operation updates[i], you need to increment all elements in the range from index startIdx$_i$ to endIdx$_i$ (inclusive) by inc$_i$.

Return the modified array after applying all the updates.

Constraints:

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

• $0 \leq$ updates.length $\leq 10^4$

• $0 \leq$ startIdx$_i \leq$ endIdx$_i <$ length

• $-1000 \leq$ inc$_i \leq 1000$

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.