Test cases not passing

[kunal81198 (Kunal Babbar)]

why isnt any of my test cases passing pls help. The solution is being accepted on leetcode

[asaurabh_26 (logical coder)]

Your approach is not correct

use kadane’s algorithm to find maximum circular sum

details solution is mention below

How to solve this problem(Maximum circular sum)

approach is using kadan’s algorithm for circular subarray 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-wr…

read this and if you have some doubt or you want to ask something
feel free to ask here

if you want to ask something about this feel free to ask
i hope this helps
if yes show your response with and don’t forgot to mark doubt as resolved

[kunal81198 (Kunal Babbar)]

Bro my approach is correct its kadanes algorithm only pls see it carefully and instead of posting your solution help me in finding problem in my code

[asaurabh_26 (logical coder)]

ohh okay sorry
your code is correct
only mistake you have done is you put return 0 inside loop
hence it is executing only one testcase and hence lead to wrong ans