Kadane’s Algorithm Variation | Dataford Interview Questions

Implement a variation of Kadane’s algorithm to solve a specific array problem.

Given a non-empty list of integers, return the largest sum among all contiguous subarrays. The subarray must contain at least one element, and the result may be negative.

Function signature: def max_subarray_sum(nums):

Input is a list of integers. Output is one integer representing the maximum contiguous subarray sum.

Constraints

1 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
nums contains at least one element

Function Signature

def max_subarray_sum(nums):

Your question is Kadane’s Algorithm Variation. 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