Easy C++ Explaination O(N) using Map
class Solution {\npublic:\n\n//         we can have only odd number of a particular char only one time in a pallindrome\n   ```\n bool canConstruct(string s, in
class Solution {\npublic:\n\n//         we can have only odd number of a particular char only one time in a pallindrome\n   ```\n bool canConstruct(string s, int k) \n{\n\t\t if(s.size()<k)\n\t\t\t\treturn false;\n       unordered_map<char,int> frq;\n            for(int i=0;i<s.size();i++)\n            {\n                    frq[s[i]]++;\n            }\n            int cnt=0;\n            for(auto x: frq)\n                    \n            {\n                    if(x.second%2==1)\n                            cnt++;\n            }\n            if(cnt>k)\n                    return false;\n           else\n            return true;\n    }\n};
['C']