Construct K Palindrome Strings

class Solution {
public:
    bool canConstruct(string s, int k) {
        int cnt = 0;
        for(const char &ch: s) cnt ^= 1 << (ch - 'a');
        return s.size() >= k && __builtin_popcount(cnt) <= k;
    }
};