You are given an integer array nums. You must perform an operation exactly once by choosing an index i and replacing nums[i] with nums[i] * nums[i].

Return the maximum possible sum of a contiguous non empty subarray after applying this operation.

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

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.