How would you write the code find the subsequence with the maximum sum of n integers?
Anonymous
int curSum = 0; int totalSum = 0; for (int i=0; i totalSum) { totalSum = curSum; } } return totalSum;
Check out your Company Bowl for anonymous work chats.