Not getting the Question

#1

I am not getting what the question is trying to say Maximum circular sum. why was -11 not added.

#2

Hi Ashutosh
The Approach used in this Question is Kadane’s Algorithum.
Let’s Understand more about this problem by these 2 case:-
For finding the Maximum Contiguous sum we are using the kadane’s algorithm. But in the question the array is circular that means the maximum sum can be of elements which are a part of the wrapping or not. So,
There can be two cases for the maximum sum:
Case 1: The elements that contribute to the maximum sum are arranged such that no wrapping is there. Examples: {-10, 2, -1, 5}, {-2, 4, -1, 4, -1}. In this case, Kadane’s algorithm will produce the result.

Case 2: The elements which contribute to the maximum sum are arranged such that wrapping is there. Examples: {10, -12, 11}, {12, -5, 4, -8, 11}. In this case, we change wrapping to non-wrapping. Let us see how. Wrapping of contributing elements implies non wrapping of non contributing elements, so find out the sum of non contributing elements and subtract this sum from the total sum. To find out the sum of non contributing, invert sign of each element and then run Kadane’s algorithm. Our array is like a ring and we have to eliminate the maximum continuous negative that implies maximum continuous positive in the inverted arrays.

I Hope now you get the logic for this problem and if you still face any issue Please let me know.

#3

I did not get it can you explai it again

#4

The elements that contribute to the maximum sum are arranged such that no wrapping is there. Examples: what is meant by wrapping