Simple Approach || Easy to Beats 100% ||
Firstly ,Thanks for come in my solution :)Complexity
Time complexity:O(N)

Space complexity:O(N)
Code
**Firstly ,Thanks for come in my solution :)**

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

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

# Code
```cpp []
class Solution {
public:
    bool canConstruct(string s, int k) {
        if(s.size() < k) return false;
        if (s.size() == k) return true;
        unordered_map<char,int>mp;

        // Frequency count of all character in S
        for(char ch : s){
            mp[ch]++;
        }

        // Count the odd frequencies 
        int count  = 0;
        for(auto key : mp){
            if(key.second%2 == 1) count++;
        }
        return (count > k)?false:true;
    }
};
```
['Hash Table', 'String', 'Greedy', 'Counting', 'C++']