Given an integer array nums, find the maximum absolute sum of any contiguous subarray within nums.

The absolute sum of a subarray is defined as the absolute value of the sum of all elements contained in that subarray.

Constraints:

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

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

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.