Approach for the question

#1

I want to know how to approach this question

#2

to solve this question use Kadane’s algorithm for circular array

Algorithm

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}. 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 the sign of each element and then run Kadane’s algorithm.

Finally, we compare the sum obtained by both cases and return the maximum of the two sums.

Reference Code

#3

why did we reverse the signs of the elements?

#4

yes reverse sign of every element

it is the part of algorithm
you have to follow this

basically is done to calculate the sum of non contributing elements

#5

what are non contributing elements exactly?

#6

those elements which are not contributing in normal kadane’s algorithms

#7

okay, but the code you provided isn’t working

#8

remove line no. 24 then it works

#9

Removed, but still not working

#10

what not working??
it is giving wrong ans or not passing testcases?

#11

Giving wrong ans and not passing test cases as well

#12

actually my code is for only one testcases
but in the question there are multiple testcase
so you need to adjust that
Modified Code

#13

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.