Given a string s consisting of lowercase English letters, calculate the reverse degree of the string.

The reverse degree is the sum of the products calculated for each character in s. For each character, multiply:

1. Its $1$ based position in the reversed English alphabet, where 'z' is $1$, 'y' is $2$, and 'a' is $26$.

2. Its $1$ based index in s.

Return the total reverse degree of s.

Constraints:

• $1 \leq$ s.length $\leq 1000$

• s contains only lowercase English 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.