Given a string s, return the total number of homogenous substrings present in s.

A string is considered homogenous if every character in the string is identical.

A substring is a contiguous non empty sequence of characters within a string.

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

Constraints:

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

• s consists of lowercase letters.

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.