100% faster code in O(n) time and O(1) space
IntuitionWe need to find if we can make k palindromes by shuffling the alphabets of a string.ApproachSo we will count the number of alphabets those are present
# Intuition
We need to find if we can make k palindromes by shuffling the alphabets of a string.
<!-- Describe your first thoughts on how to solve this problem. -->

# Approach
So we will count the number of alphabets those are present odd number of times, as each palindrome can have at most 1 odd occurance character. hence we will output the answer.
<!-- 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 true;
        }
        if(s.length()<k){
            return false;
        }
        vector<int> v(26,0);
        for(char c : s){
            v[c-'a']++;
        }
        int count = 0;
        for(int i : v){
            if(i%2==1){
                count++;
            }
        }
        if(count<=k){
            return true;
        }
        return false;
    }
};
```
['String', 'Greedy', 'Counting', 'C++']