409. Longest Palindrome

class Solution: def longestPalindrome(self, s: str) -> int: d = defaultdict(int) x = set() ans = 0 for e in s: d[e] += 1 v = d[e] if v == 2: ans += 2 ...