✅🔥BEATS 100%🔥 || Beginner Friendly || Construct K Palindrome Strings 💡|| CONCISE CODE ✅
IntuitionApproachComplexity
Time complexity: O(n)

Space complexity: O(1)
Code
# Intuition
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
<!-- Describe your approach to solving the problem. -->

# Complexity
- Time complexity: O(n)
<!-- Add your time complexity here, e.g. $$O(n)$$ -->

- Space complexity: O(1)
<!-- Add your space complexity here, e.g. $$O(n)$$ -->

# Code
```cpp []
class Solution {
public:
    bool canConstruct(string s, int k) {
        if(s.length() < k){
            return false;
        }
        vector<int> hash(26, 0);
        for(int i = 0; i < s.length(); i++){
            hash[s[i] - 'a']++;
        }
        int cnt = 0;
        for(int i = 0; i < 26; i++){
            if(hash[i]%2){
                cnt++;
            }
        }

        return cnt <= k;
    }
};
```
['C++']