<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 longestAwesome(string s)
    {
        int n = s.size();
        int ans = 0;

        map<string, int> mpp;
        string curr;

        while (curr.size() < 10)
        {
            curr += '0';
        }
        mpp[curr] = -1;

        for (int i = 0; i < n; i++)
        {
            int num = s[i] - '0';
            // curr[num] = 1 - curr[num];
            if (curr[num] == '1')
            {
                curr[num] = '0';
            }
            else
            {
                curr[num] = '1';
            }
            if (mpp.find(curr) != mpp.end())
            {
                ans = max(ans, i - mpp[curr]);
            }
            for (int j = 0; j < 10; j++)
            {
                string temp = curr;
                if (curr[j] == '0')
                {
                    temp[j] = '1';
                }
                else
                {
                    temp[j] = '0';
                }
                if (mpp.find(temp) != mpp.end())
                {
                    ans = max(ans, i - mpp[temp]);
                }
            }
            if (mpp.find(curr) == mpp.end())
            {
                mpp[curr] = i;
            }
        }
        return ans;
    }
};
16100