Leetcode 1186. Maximum Subarray Sum with One Deletion

Find the maximum sum of a non-empty contiguous subarray when you may remove at most one element; this is solved by a Kadane-style DP that tracks the best subarray ending at each index with zero deletions and with one deletion, then takes the overall maximum.