You are given a $0$ indexed string s. In one operation, you can perform the following steps:

1. Find the largest index i such that $1 \leq i <$ s.length and s[i - 1] > s[i].

2. Find the largest index j such that $i \leq j <$ s.length and s[i - 1] > s[j].

3. Swap the characters s[i - 1] and s[j].

4. Reverse the suffix of s starting at index i.

Return the number of operations needed to make s sorted in ascending order. Since the answer may be very large, return it modulo $10^9 + 7$.

Constraints:

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

• s consists only of 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.