<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:
        #9-1000000000,8-00000000,7-10000000,6-1000000,5-100000,4-10000,3-1000,2-100,1-10,0-1
        cur_state = 0
        length = 0
        mapx = {}
        mapx[cur_state] = -1
        for i in range(len(s)):
            cur_state ^= (1<<int(s[i]))
            
           
            if cur_state in mapx:
                length = max(length,i-mapx[cur_state])
            else:
                mapx[cur_state] = i

             # Now, check all states with one bit flipped (to allow for one odd digit)
            for j in range(10):
                temp = cur_state ^ (1 << j)  # Flip the j-th bit
                if temp in mapx:
                    length = max(length, i - mapx[temp])
                
        return length
        




17400