Better Maximal Sum | CodeChef

i computed best sum till ith index in start array and similarly best sum from the end for every index in end array , and later on just checked the maximum of start[i-1]+end[i+1](it checks the max sum subarray excluding ith element).
and it in the end took max of this with the maximum value from start array(means max subarray sum without removing any element),
But still there is something wrong in the code.

could anybody help plz :slight_smile: