Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
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 1746. Maximum Subarray Sum After One Operation
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source