code:- https://ide.codingblocks.com/s/288150
logic:- consider an array i is at starting and j at end…if arr[i] > arr[j] then add arr[i] in window else add arr[j] then check max of m and window and store it in m…then check if window is less then 0 then make window 0
Dont know where it could go wrong
read the logic of how to solve maximum circular sum here
can you please check my acpproach…it is giving correct output nd i am not able to find any loophole…but the it is not getting submitted
please help me find the loopjhole in the code
bro
it is not about finding a loop hole in the code
yeh question aise nhi kia jata
u need to use modified kadane algorithm for which i have provided to the link from where u can understand