Intresting problem || C++
\n  int longestAwesome(string A ) {\n        \n        int N = A.size();\n        string t(10,0);\n        unordered_map< string , int > M ;\n        M[t] = -1 
```\n  int longestAwesome(string A ) {\n        \n        int N = A.size();\n        string t(10,0);\n        unordered_map< string , int > M ;\n        M[t] = -1 ;\n        int res = 0 ;\n        \n        for( int i = 0 ; i < N ; i++ )\n        {\n            int v = A[i]-\'0\';\n            t[v] ^= 1 ;\n            \n            // even count \n            if( M.find(t) != M.end() )\n                res = max( res , i-M[t]);\n            // one odd count \n            for( int j = 0 ; j < 10 ; j++ )\n            {\n                t[j] ^= 1;\n                \n                if( M.find(t) != M.end() )\n                    res = max( res , i-M[t] );\n                \n                t[j] ^= 1;\n            }\n            \n            if( M.find(t) == M.end() )\n                M[t] = i ;\n        }\n        return res ;\n    }\n```
['C']