You are given an integer array nums.

Consider partitioning nums into one or more contiguous nonempty subarrays. The cost of a subarray nums[l \dots r] is calculated as:

$ ext{cost}(l, r) = ext{nums}[l] - ext{nums}[l + 1] + ext{nums}[l + 2] - \dots + ext{nums}[r] imes (-1)^{r - l}$

The total cost of the partition is the sum of the costs of each subarray.

Return the maximum possible total cost after partitioning nums.

Constraints:

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

• $-10^9 \leq$ nums[i] $\leq 10^9$

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.