Question d’entretien chez J.P. Morgan

Write an algorithm to detect the highest subsequence sum in an array.