Python beats 97% with reasoning
\nclass Solution:\n    def canConstruct(self, s: str, k: int) -> bool:\n        \'\'\'\n        For a palindrome, its odd-count character has to be less than or
```\nclass Solution:\n    def canConstruct(self, s: str, k: int) -> bool:\n        \'\'\'\n        For a palindrome, its odd-count character has to be less than or eqaul to one. \n        Then in order to get k many palindromic substrings, the number of odd-count chracters in s has to be less than\n        or equal to k \'\'\'\n        \n        if len(s) < k:\n            return False\n        freq = Counter(s)\n        return sum(1 for val in freq.values() if val % 2 != 0) <= k\n```
['Python']