Simple C++ hashing Solution (12 line code)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int longestAwesome(string s) {\n        int n = s.length();\n        unordered_map<int, int> mp;\n        mp[0] = -1;\n        int curr = 0, res = 1;\n        for(int i=0; i<n; i++){\n            int num = s[i]-\'0\';\n            curr = curr^(1<<num);\n            if(mp.find(curr) != mp.end()) res = max(res, i-mp[curr]);\n            for(int j=0; j<10; j++){\n                int tmp = curr^(1<<j);\n                if(mp.find(tmp) != mp.end()) res = max(res, i-mp[tmp]);\n            }\n            if(mp.find(curr) == mp.end()) mp[curr] = i;\n        }\n        return res;\n    }\n};\n```
['Hash Table', 'C++']