Leetcode 1746. Maximum Subarray Sum After One Operation

Given an integer array, you may apply a single operation to one contiguous subarray (e.g., doubling every element in that segment); compute the maximum subarray sum achievable after at most one such operation. This requires extending Kadane's algorithm / using DP to track best sums with and without the operation and combine them optimally.