You are given an integer array nums of length $n$ and a positive integer k.

A subarray nums[i..j] is called good if the absolute difference between its first and last elements is equal to k, which means $|$nums[i] - nums[j]|$ = k$.

Return the maximum sum of a good subarray. If no good subarray can be found, return $0$.

Note: A subarray is a contiguous non empty sequence of elements within an array.

Constraints:

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

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

• $1 \leq$ k $\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.