Kadane Algorithm | Dataford Interview Questions

How would you implement the Kadane algorithm?

Implement max_subarray(nums), which returns the maximum possible sum of any non-empty contiguous subarray. The input is a non-empty list of integers, and the output is an integer. Handle arrays containing only negative values.

Constraints

1 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
The input contains at least one element
The subarray must be contiguous and non-empty

Function Signature

def max_subarray(nums):

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

How would you implement the Kadane algorithm?

Constraints

1 <= nums.length <= 1000
-10^9 <= nums[i] <= 10^9
The input contains at least one element
The subarray must be contiguous and non-empty

Function Signature

def max_subarray(nums):

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