NeetCode #374LC-907MediumStack
← Back to All Problems#374 · #907 · Sum of Subarray Minimums(子数组的最小值之和)
📌 Problem Statement & Constraints
Given an array of integers
arr, return the sum of min(b) over every contiguous subarray b, modulo 10^9 + 7. Constraints: 1 <= arr.length <= 3 * 10^4, 1 <= arr[i] <= 3 * 10^4.🔒
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!