From 7a189702549459a93b81e5f838823360d37b145d Mon Sep 17 00:00:00 2001
From: Rahul Gupta <59743796+rahul22nrp@users.noreply.github.com>
Date: Tue, 25 May 2021 12:18:51 +0530
Subject: [PATCH] Create Maximum Sum Circular Subarray

---
 Maximum Sum Circular Subarray | 28 ++++++++++++++++++++++++++++
 1 file changed, 28 insertions(+)
 create mode 100644 Maximum Sum Circular Subarray

diff --git a/Maximum Sum Circular Subarray b/Maximum Sum Circular Subarray
new file mode 100644
index 0000000..ad3f129
--- /dev/null
+++ b/Maximum Sum Circular Subarray	
@@ -0,0 +1,28 @@
+ int kadanes(vector<int>&nums){
+         int sum = nums[0], answer = nums[0];
+        for(int i=1; i<nums.size(); i++){
+            sum += nums[i];
+            if(sum < nums[i]) sum = nums[i];
+            answer = max(answer, sum);
+        }
+        return answer;
+    }
+public:
+    int maxSubarraySumCircular(vector<int>& nums) {
+        int n=nums.size();
+        if(n== 0)
+        return 0;
+        
+        int x= kadanes(nums);
+        int y=0;
+        for(int i=0;i<n;i++){
+            y=y+nums[i];
+            nums[i]*=-1;
+        }
+        
+        int z= kadanes(nums);
+        if(y+z==0) return x;
+        
+        return max(x,y+z);
+        
+    }