A function to check if a string can be re-arranged into a palindrome.

can_be_palindrome.py

def can_make_palindrome2(string):
    letters = set(string)
    length = len(string)
    
    if length & 1:
       temp = map(lambda x: string.count(x) & 1, letters)
       return any(temp) and not(any(temp))
    else:
       return all(map(lambda x: not(string.count(x) & 1), letters))

print(can_make_palindrome2("boob"))
print(can_make_palindrome2("boobs"))