Available question text
Since subarrays can overlap and be repeated, the optimal pick is any subarray containing the global maximum and minimum, so the maximum total is simply k * (max(nums) - min(nums)).
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 3689. Maximum Total Subarray Value I
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source