easy short clean efficient code
\nclass Solution {\ntypedef long long ll;\n#define vi(x) vector<x>\npublic:\n    int longestAwesome(const string&s) {\n        ll n=s.size(), bm=0, ans=1;\n    
```\nclass Solution {\ntypedef long long ll;\n#define vi(x) vector<x>\npublic:\n    int longestAwesome(const string&s) {\n        ll n=s.size(), bm=0, ans=1;\n        vi(ll)ump(1024, n);\n        ump[0]=-1;\n        for(ll i=0;i<n;++i){\n            bm^=1<<(s[i]-\'0\');\n            ans=max(ans, i-ump[bm]);\n            for(ll j=0;j<10;++j){\n                ans=max(ans, i-ump[bm^(1<<j)]);\n            }\n            ump[bm]=min(ump[bm], i);\n        }\n        return ans;\n    }\n};\n```
['C', 'Bitmask']