Palindrome Permutation Python Solution

lcpy gen -n 266   # by problem number
lcpy gen -s palindrome_permutation   # by problem name

Input: s = "code"
Output: false

Input: s = "aab"
Output: true

Input: s = "carerac"
Output: true

from collections import Counter


class Solution:
    # Time: O(n)
    # Space: O(1) for the 26-letter alphabet
    def can_permute_palindrome(self, s: str) -> bool:
        counts = Counter(s)
        return sum(count % 2 for count in counts.values()) < 2