Longest Palindrome Python Solution with Tests

lcpy gen -n 409   # by problem number
lcpy gen -s longest_palindrome   # by problem name

Input: s = "abccccdd"
Output: 7

Input: s = "a"
Output: 1

class Solution:
    # Time: O(n)
    # Space: O(1)
    def longest_palindrome(self, s: str) -> int:
        char_count: dict[str, int] = {}
        for char in s:
            char_count[char] = char_count.get(char, 0) + 1

        length = 0
        has_odd = False

        for count in char_count.values():
            length += count // 2 * 2
            if count % 2 == 1:
                has_odd = True

        return length + (1 if has_odd else 0)