Hi all,

Can anybody help me with a an algorithm to find the maximum subset sum in an array.

It would be better if the solution is of O(n).

[example: {5,-2,10,-4} the maximum is 5 + (-2) + 10 => 13].

This topic has been dead for over six months. Start a new discussion instead.

Recommended Topics