You are given an integer array strength, where strength[i] denotes the strength of the $i^{th}$ wizard.

A group of wizards is defined as a non empty contiguous subarray of strength. The total strength of a group is defined as the product of:

1. The minimum strength among all wizards in the group.

2. The total sum of the strengths of all wizards in the group.

Return the sum of the total strengths of all contiguous groups of wizards.

Note: Since the answer may be very large, return it modulo $10^9 + 7$.

Constraints:

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

• $1 \leq$ strength[i] $\leq 10^9$

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.