Skip to content
Tagged articles

subarray

2 articles · Page 1 of 1
Su San Talks Tech
Su San Talks Tech
Mar 29, 2025 · Fundamentals

Maximize Subarray Sum with One Deletion – LeetCode 1186 Solution

This article explains LeetCode problem 1186, which asks for the maximum sum of a contiguous subarray after optionally deleting one element, and presents a dynamic‑programming solution with recurrence formulas, base cases, and full Java and C++ implementations.

AlgorithmC++Dynamic Programming
0 likes · 6 min read
Maximize Subarray Sum with One Deletion – LeetCode 1186 Solution