PYTHON💡|| CONCISE CODE✅||
Complexity
Time complexity:

Space complexity:
Code
# Complexity
- Time complexity:
<!-- Add your time complexity here, e.g. $$O(n)$$ -->
    O(n)
- Space complexity:
<!-- Add your space complexity here, e.g. $$O(n)$$ -->
    O(1)
# Code
```python3 []
from collections import Counter
class Solution:
    def canConstruct(self, s: str, k: int) -> bool:
        num=0
        if len(s)==k:
            return True
        elif len(s)<k:
            return False
        count=Counter(s)
        for i in range(len(set(s))):
            if count[s[i]]%2==1:
                num+=1
        if num>k:
            return False
        else:
            return True
```
['Python3']