<p>Given a <strong>circular integer array</strong> <code>nums</code> of length <code>n</code>, return <em>the maximum possible sum of a non-empty <strong>subarray</strong> of </em><code>nums</code>.</p>

<p>A <strong>circular array</strong> means the end of the array connects to the beginning of the array. Formally, the next element of <code>nums[i]</code> is <code>nums[(i + 1) % n]</code> and the previous element of <code>nums[i]</code> is <code>nums[(i - 1 + n) % n]</code>.</p>

<p>A <strong>subarray</strong> may only include each element of the fixed buffer <code>nums</code> at most once. Formally, for a subarray <code>nums[i], nums[i + 1], ..., nums[j]</code>, there does not exist <code>i &lt;= k1</code>, <code>k2 &lt;= j</code> with <code>k1 % n == k2 % n</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,-2,3,-2]
<strong>Output:</strong> 3
<strong>Explanation:</strong> Subarray [3] has maximum sum 3.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [5,-3,5]
<strong>Output:</strong> 10
<strong>Explanation:</strong> Subarray [5,5] has maximum sum 5 + 5 = 10.
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [-3,-2,-3]
<strong>Output:</strong> -2
<strong>Explanation:</strong> Subarray [-2] has maximum sum -2.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>n == nums.length</code></li>
	<li><code>1 &lt;= n &lt;= 3 * 10<sup>4</sup></code></li>
	<li><code>-3 * 10<sup>4</sup> &lt;= nums[i] &lt;= 3 * 10<sup>4</sup></code></li>
</ul>

class Solution {
public:

int minfn(vector<int>nums){
  int minelement = 1e9;
    for(int i = 0;i<nums.size();i++){
        minelement = min(minelement,nums[i]);
    }
    if(minelement>=0)
    return minelement;

    int sum  = 0;
    int minisum = 1e9;
    for(int i = 0;i<nums.size();i++){
        sum = sum+nums[i];
        if(sum>=0)
        sum = 0;

        minisum = min(sum,minisum);
    }
    return minisum;

}
    int maxSubarraySumCircular(vector<int>& nums ) {



          int n = nums.size();
     vector<int>prefixsum(n);

         

            int maxelement  = nums[0];
         int totalsum = nums[0] ;
         prefixsum[0] = nums[0];
     for(int i = 1;i<n;i++){
        prefixsum[i] = prefixsum[i-1]+nums[i];
        totalsum+=nums[i];
        maxelement = max(maxelement,nums[i]);
     }
     cout<<"he";

     if(maxelement<=0)
     return maxelement;

int tempsum = 0;
int maxisumarr = 0;
           for(int k = 0;k<n;k++){
            tempsum+=nums[k];
            if(tempsum<=0)
            tempsum=0;

            maxisumarr = max(maxisumarr,tempsum);
           }



        int minisum = minfn(nums);
        int sumarr;
    //   for(int i = 0;i<n;i++){
    //     for(int j = i;j<n;j++){
            
    //         if(i==0)
    //         sumarr = prefixsum[j];
    //         else
    //         sumarr = prefixsum[j]-prefixsum[i-1];
    //         minisum = min(minisum,sumarr);
    //     }
    //   }
      cout<<minisum;

      return max(maxisumarr,totalsum-minisum);
    }


};
45500