Given an integer array nums, return the sum of all elements across all consecutive subarrays.

A subarray is a contiguous sequence of elements within an array. A subarray is consecutive if every adjacent pair of elements has a difference of $1$, and all elements in the subarray are either strictly increasing or strictly decreasing. Subarrays of length $1$ are always consecutive.

Constraints:

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

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

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.