Circular subarray sum

#1

whats the problem with this code
too large o(N)?

#2

Please save your code on ide.codingblocks.com and then share its link.

#3
#4

can you help me by telling a test case where it will go wrong

#5
#6

Include an endl after line 61 and then check if test cases are passed.

Also i think…you are duplicating /doubling your array and then applying Kadane.
A better approach is there. You can refer the editorial or refer this link:

#7

Also you have to take care not to have a sum with more elements than the initial array.

#8

using a loop i am taking only n elements at a time