You are given a string s consisting of digits.

An index i (where $0 \leq i <$ s.length) is considered good if the substring of s ending at index i is identical to the decimal string representation of i.

Return an array containing all good indices sorted in ascending order.

Constraints:

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

• s consists only of digits from $0$ 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.