Array Subarray With One Deletion | Dataford Interview Questions

Given an array of integers arr, you can delete at most one element. Find the maximum sum of a non-empty subarray after performing this operation (or no deletion).

Implement maximum_sum(arr) and return an integer. The input is a non-empty list of integers, and the result must correspond to a non-empty subarray after the optional deletion.

Constraints

1 <= len(arr) <= 5000
-10^9 <= arr[i] <= 10^9
The input array is non-empty
At most one element may be deleted
The resulting subarray must be non-empty

Function Signature

def maximum_sum(arr):

Your question is Array Subarray With One Deletion. 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

Given an array of integers arr, you can delete at most one element. Find the maximum sum of a non-empty subarray after performing this operation (or no deletion).

Implement maximum_sum(arr) and return an integer. The input is a non-empty list of integers, and the result must correspond to a non-empty subarray after the optional deletion.

Constraints

1 <= len(arr) <= 5000
-10^9 <= arr[i] <= 10^9
The input array is non-empty
At most one element may be deleted
The resulting subarray must be non-empty

Function Signature

def maximum_sum(arr):

Your question is Array Subarray With One Deletion. 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.