Given a string s consisting of digits.

An awesome substring is a non empty substring of s that can be rearranged into a palindrome by performing any number of swaps on its characters.

Return the maximum length of an awesome substring in s.

Constraints:

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

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