#K52467. Can Form Palindrome
Can Form Palindrome
Can Form Palindrome
Given a string s, determine if its characters can be rearranged to form a palindromic string.
A palindrome is a string that reads the same backward and forward. Mathematically, a string can be rearranged into a palindrome if and only if at most one character has an odd frequency. In other words, if we denote by \( f(c) \) the frequency of character \( c \), then the necessary and sufficient condition is:
\( \sum_{c}\left[ f(c) \mod 2 \neq 0 \right] \leq 1 \)
The input string may include alphabets (both uppercase and lowercase) and numbers. The comparison should be made in a case-insensitive manner.
Your task is to print "True" if the string can be rearranged to form a palindrome, otherwise print "False".
inputFormat
A single line containing the string s.
outputFormat
Output "True" if the characters of the input string can be rearranged to form a palindrome, otherwise output "False".## sample
aabbcc
True