You are given an integer array nums. The value of an array is defined as the sum of $|$nums[i] $-$ nums[i + 1]$|$ across all $0 \leq$ i $<$ nums.length $- 1$.

You may select at most one contiguous subarray of nums and reverse it.

Return the maximum possible value of the array after performing at most one such reversal.

Constraints:

• $2 \leq$ nums.length $\leq 3 imes 10^4$

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

• The answer is guaranteed to fit in 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.