Why they are calculating the max wrap as max wrap + kadane of inverted array.
according to algo. how they are getting candidate 2 algo.
Maximum circular subarray candidate 2 sum part
@piyush.bansal8158625
There are two possibilties in this question. One is that the subarray is present simply and there is no point in taking it as circular , that is , the maximum sum subarray does not need to include the roundabout provided by the array being circular.
In such a case , a simply Kadane’s Algo works. This is the possibility for Candidate 1.
The other possiblity is that the max subarray sum requires the roundabout provided by the circular array. In such a case , we implement the Algo as mentioned for Candidate 2 in the editorial. Take the inverse of terms and then apply the Kadane’s Algo. The maximum sum thus obtained from the inverse array is actually the minimum subarray sum of the original array.
Subtracting this minimum subarray sum from the total sum would give us the max circular sum. Now read the statement.