Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Subarray Sum After One Operation
Coding
- Maximum Unique Subarray Sum After Deletion
Coding
- Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. Walk through Kadane's algorithm and explain the O(n) approach.
Coding
- Maximize Subarray Sum After Removing All Occurrences of One Element
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1186. Maximum Subarray Sum with One Deletion
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source