The catch here is that we have to take care of negative value.

The solution does 1 iteration with constant space and no DP.

```
public class Solution {
public int maxSubArray(int[] A) {
int max = Integer.MIN_VALUE, sum = 0;
for (int i = 0; i < A.length; i++) {
if (sum < 0)
sum = A[i];
else
sum += A[i];
if (sum > max)
max = sum;
}
return max;
}
```

}