What’s wrong with my code, it’s not passing all the test cases,
Max Circular Sum
hello @s.kumar
here u are only considering corner (left and right) sum.
u have considered -> Maximum subarray sum in non circular array.
so use trival kadane to find max and then compare the two values anf then print the maximum of them
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.