Given a string s made up only of digit characters, count how many subsequences of s form a palindrome of length $5$.

Return the total number of such palindromic subsequences.

Note:

• A string is palindromic if it reads the same forward and backward.

• A subsequence is obtained by deleting zero or more characters from s without changing the relative order of the remaining characters.

• A subsequence is defined by the indices chosen from s, so identical resulting strings formed from different index selections are counted multiple times.

Constraints:

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

• s consists of digits.

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.