My calgorithm is based on two pointer theorem but my code is not being submitted givinig wrong answer

#1
#2

hello @manthan.joshi.jiit
what logic u r applying ,can u please explain.

i dont think 2 pointers from two ends will works

#3

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

#4

continue this loop while i<=j

#5

it should work fine i guess

#6

no it will not work.
check it for this ->
1 2 3 -10 -40 2

#7

my code is giving 8 which i guess is the correct answer

#8

please help me find the loophole in the code

#9

try for this->
-1 3 4 -40 5 -3 9 -2