Please provide a detailed solution for this

[Mac2503]

Please provide a detailed solution for this question as I am not able to understand the answer provided.

[chhavibansal]

My circular sum sub array is failing test cases

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.[image] 1+2+5 = 8 For non circular sum, Step 1) find the minimum subarray sum of array. [image] -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 …

please read the explanation