You are given an integer array target. You have an array initial of the same length where every element is initially $0$.

In a single operation, you can select any contiguous subarray of initial and increment each of its elements by $1$.

Return the minimum number of operations required to transform initial into target.

Constraints:

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

• $1 \leq$ target[i] $\leq 10^5$

• The input is generated such that the answer fits inside a $32$ bit integer.

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.