Maximum Subarray Sum (Algorithm & Java Code)

Given an integer array, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. This code works both for positive and negative cases.

[ritabratanag]

Exactly what I was looking for.. Thank you very much sir

[besuynaitsa]

If arr = [1]; the program outputs 2 which is not correct.

[walidmebarki]

sir i need the code position of the first and last elements to the sum

[dheerajsahu]

What If all the elements are negative then it will always return wrong value

[MohdDanish-kvry]

You did not get the contiguous subarray which was asked in the question.? Pleasse elaborate/

[sheriffcrandy]

Bu how do you keep track of the contiguous array and return the contiguous array?

[NidhiKumari-ibow]

Is this code make two pointers array apporch.

[varuns]

{-1, -10, 10, -1, 10, -18}
Is this code valid for above testcase ?

[jobshorts]

If all number will be positive then it will not

[ProgrammingTutorialsM]

Code link is present in the description box.

[Aish-dmnp]

Sir if you can explain in hindi it would be more better and you will be getting so many more views

[samarchourasia]

questions are good but who so ever is explaining these problems needs to clear his hesitation and concepts then properly prepare for presentation before explaination.

[adrianiordache]

Well explained, but improve your english please.