NeetCode #680LC-1856Medium1-D Dynamic Programming
← Back to All Problems#680 · #1856 · Maximum Subarray Min-Product(子数组最小乘积的最大值)
📌 Problem Statement & Constraints
The min-product of a subarray is its minimum value multiplied by its sum. Given an array
nums, return the maximum min-product over all subarrays, modulo 10^9 + 7. Constraints: 1 <= nums.length <= 10^5, 1 <= nums[i] <= 10^7.🔒
Sign In to Unlock Full Solutions for All 973 Problems
Sign in to access step-by-step logic, benchmark Python3 code, complexity breakdown, and offline export!