266. Palindrome Permutation - English Version

[aunnfriends]

class Solution:
def canPermutePalindrome(self, s):
count = 0
dic = collections.defaultdict(int)
for char in s:
dic[char] += 1
for key, val in dic.items():
count += val % 2
return count <= 1

Your submission beats 81.20% Submissions!