Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.