Given an integer array arr, return the maximum sum of a non empty subarray where you can choose to delete at most $1$ element.

Note: The subarray must contain at least $1$ element after performing the optional deletion.

Constraints:

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

• $-10^4 \leq$ arr[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.