<p>You are given a string <code>s</code>. An <strong>awesome</strong> substring is a non-empty substring of <code>s</code> such that we can make any number of swaps in order to make it a palindrome.</p>

<p>Return <em>the length of the maximum length <strong>awesome substring</strong> of</em> <code>s</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;3242415&quot;
<strong>Output:</strong> 5
<strong>Explanation:</strong> &quot;24241&quot; is the longest awesome substring, we can form the palindrome &quot;24142&quot; with some swaps.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;12345678&quot;
<strong>Output:</strong> 1
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> s = &quot;213123&quot;
<strong>Output:</strong> 6
<strong>Explanation:</strong> &quot;213123&quot; is the longest awesome substring, we can form the palindrome &quot;231132&quot; with some swaps.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 10<sup>5</sup></code></li>
	<li><code>s</code> consists only of digits.</li>
</ul>

class Solution:
    def longestAwesome(self, s: str) -> int:
        # Create a dictionary to store the first occurrence of each state
        first_occurrence = {0: -1}
        # Initialize the current state of bitwise representation of digits
        current_state = 0
        # Initialize the max length of the awesome substring
        max_length = 0
        
        for i, char in enumerate(s):
            # Toggle the bit corresponding to the current digit
            current_state ^= 1 << int(char)
            
            # If the current state has been seen before, calculate the length
            if current_state in first_occurrence:
                max_length = max(max_length, i - first_occurrence[current_state])
            else:
                first_occurrence[current_state] = i
            
            # Check each state with one bit toggled
            for j in range(10):
                toggled_state = current_state ^ (1 << j)
                if toggled_state in first_occurrence:
                    max_length = max(max_length, i - first_occurrence[toggled_state])
        
        return max_length
17100