Given an integer array nums representing a circular array, return the maximum possible sum of a non empty subarray of nums.

A subarray is a contiguous sequence of elements. Because nums is circular, a subarray may wrap from the end of the array back to the beginning, but each element of nums can be included at most once in the chosen subarray.

Constraints:

• n == nums.length

• $1 \leq$ n $\leq 3 \cdot 10^4$

• $-3 \cdot 10^4 \leq$ nums[i] $\leq 3 \cdot 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.