You are given two integer arrays nums and target of equal length.

In a single operation, you can choose any contiguous subarray of nums and increment or decrement all values within that subarray by $1$.

Return the minimum number of operations needed to transform nums into target.

Constraints:

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

• $1 \leq$ nums[i], target[i] $\leq 10^8$

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.