Alice is typing a text message on a classic mobile phone keypad. Each digit from '2' to '9' is mapped to a specific set of lowercase English letters:

• '2' maps to 'a', 'b', 'c'

• '3' maps to 'd', 'e', 'f'

• '4' maps to 'g', 'h', 'i'

• '5' maps to 'j', 'k', 'l'

• '6' maps to 'm', 'n', 'o'

• '7' maps to 'p', 'q', 'r', 's'

• '8' maps to 't', 'u', 'v'

• '9' maps to 'w', 'x', 'y', 'z'

To type a character, a button is pressed consecutively between $1$ and $3$ times for keys mapping to $3$ letters, or between $1$ and $4$ times for keys mapping to $4$ letters.

Given a string pressedKeys representing the sequence of button presses, return the total number of possible text messages Alice could have sent.

Since the result can be very large, return it modulo $10^9 + 7$.

Constraints:

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

• pressedKeys only consists of digits from '2' to '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.