Available question text
Find the maximum value of (minimum element of a contiguous subarray) × (sum of that subarray) over all non-empty subarrays and return it mod 1e9+7. Key insight: for each element treated as the subarray minimum, use a monotonic stack to find its maximal span and prefix sums to compute the sum efficiently (n up to 1e5).
Related questions
Continue with questions that share topics or the same question type.
- Maximum Length of Subarray With Positive Product
Coding
- Maximum Product Subarray
Coding · Array · Dynamic Programming
- Longest Subarray With Maximum Bitwise AND
Coding
- Maximum Absolute Sum of Any Subarray
Coding
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 1856. Maximum Subarray Min-Product
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source