Sum Of Subarray Minimums Problem

Sum Of Subarray Minimums Problem — ExecCode Medium DSA Practice

Solve the Sum Of Subarray Minimums problem on ExecCode. Free online medium DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Practice companion for CodeFlow sum-of-subarray-minimums.

Examples

Input {"arr": [3, 1, 2, 4]}; Output 17. Input {"arr": [8, -9, 0, 5, 11, 3, -1, -10]}; Output 999999932. Input {"arr": [-7, -7]}; Output 0

Constraints

1 ≤ n ≤ 10^5

Practice Sum Of Subarray Minimums free on ExecCode. Browse DSA problems, topic map, and placement guides.