<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 {
public:
    int dp[100005];
    int longestAwesome(string s) {
        
        dp[0]=dp[0]+1<<(s[0]-'0');
        
        for(int i=1;i<s.size();i++)
        {
            int temp=(dp[i-1]>>(s[i]-'0'))%2;
            int x=1<<(s[i]-'0');
            if(temp) dp[i]=dp[i-1]-x;
            else dp[i]=dp[i-1]+x;
        }
        int ans=1;
        map<int,int> m;
        for(int i=0;i<s.size();i++)
        {
            int x=dp[i];
            int l=dp[i]&(dp[i]-1);

            if(m[dp[i]]==0)m[dp[i]]=i+1;
            else ans=max(ans,i+1-m[dp[i]]+1);
            if(dp[i]==0||(dp[i]&(dp[i]-1))==0) {ans=i+1;}
            for(int pos=0;pos<=10;pos++){
                int nwmask=dp[i]^(1<<pos);
                if(m.count(nwmask)){
                    ans=max(ans,i+1-m[nwmask]);
                }
            }
        }
            
        cout<<endl;
         return ans;
    }
};
15200