Kadane's Algorithm Variation | Dataford Interview Questions

Implement a variation of Kadane's Algorithm.

For this variation, find the maximum sum of a non-empty contiguous subarray after deleting at most one element from that subarray. Given a list of integers, return the maximum possible sum as an integer, and ensure that at least one element remains.

Constraints

1 <= nums.length <= 10^4
-10^4 <= nums[i] <= 10^4
At most one element may be deleted
The resulting subarray must be non-empty

Function Signature

def max_subarray_one_deletion(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

Implement a variation of Kadane's Algorithm.

Constraints

1 <= nums.length <= 10^4
-10^4 <= nums[i] <= 10^4
At most one element may be deleted
The resulting subarray must be non-empty

Function Signature

def max_subarray_one_deletion(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.