Maximum Subarray Sum | Dataford Interview Questions

Implement a function that calculates the max consecutive sum on a subsequence of integers. What is the maximum sum one can achieve by summing consecutive numbers on a finite array of positive and negative numbers? One can start and end anywhere, but it is not allowed to skip numbers.

Asked in the coding round stage. Example: nums = [2, -4, 2, -1, 3, -3, 10, -1, -11, -100, 8, -1] produces 11, using indices 2 through 6.

Contract

Implement def max_consecutive_sum(nums):. Return the maximum sum of a non-empty consecutive subsequence.

Constraints

1 <= len(nums) <= 1000
-10^9 <= nums[i] <= 10^9
The input contains at least one integer
The chosen subsequence must be non-empty and consecutive

Function Signature

def max_consecutive_sum(nums):

Your question is Maximum Subarray Sum. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem