Tag Archives: max sum subarray

Max sum subsequence with non-consecutive elements – Kadane’s Algorithm (DP)

Posted on by

Given an array of integer. Find the maximum sum subsequence such that elements are not consecutive.

For example, A = [−2, 1, −3, 4, −1, 2, 1, −5, 4] then max sum=11 with the subarray [1, 4, 2, 4].

This is a preview of Max sum subsequence with non-consecutive elements – Kadane’s Algorithm (DP). Read the full post (400 words, estimated 1:36 mins reading time)