The min product of an array is defined as the minimum value in the array multiplied by the sum of all elements in the array.

Given an array of integers nums, return the maximum min product among all nonempty subarrays of nums. Since the answer can be large, return it modulo $10^9 + 7$.

Note: The maximum min product must be determined before applying the modulo operation. A subarray is a contiguous sequence of elements within an array.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

• $1 \leq$ nums[i] $\leq 10^7$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.