def CanStringBeRearrangedAsPalindrome(s):
ascii_count = [0] * (256)
for i in range(0, len(s)):
ascii_count[ord(s[i])] = ascii_count[ord(s[i])] + 1
odd = 0
for i in range(0, 256):
if (ascii_count[i] & 1):
odd = odd + 1
if (odd > 1):
return False
return True
if (CanStringBeRearrangedAsPalindrome("abcdacdb")):
print("Yes")
else:
print("No")
if (CanStringBeRearrangedAsPalindrome("abcca")):
print("Yes")
else:
print("No")
if (CanStringBeRearrangedAsPalindrome("abcb")):
print("Yes")
else:
print("No")
'''
run:
Yes
Yes
No
'''