I am not able to figure out the algorithm for the question. Can you please help!

# Maximum Circular Sum

hello @Shivam01

The maximum subarray sum in **circular** array is maximum of following

- Maximum subarray sum in non circular array
- Maximum subarray sum in circular array.

`Example - [1,2,5,-2,-3,5]`

Steps -

- Find the maximum subarray sum using Kadane Algorithm. This is maximum sum for non circular array.

- 1+2+5 =
**8** - For non circular sum,

Step 1) find the minimum subarray sum of array.

-2-3 = **-5**

Step 2) Now find the total sum of array = 1 + 2 + 5 -2 - 3 + 5 = 8

Step 3) The max subarray sum for circular array = Total Sum - Minimum subarray Sum

= 8 - (-5) = 8 + 5 = **13**

As illustrated above, substracting minimum subarray sum from total sum gives maximum circular subarray sum.

**Answer = Max ( Non circular max sum + circular max sum )** = max(8,13) = 13

check this.

Thank You! .

hello @aman212yadav

can you please explain why you have taken

a[i] =-a[i]

or cant we fine minimum subarray by any other way?

please aman can you tell me what line 29 is denoting in this code??? Please