#K42677. Cleaned Palindrome Checker
Cleaned Palindrome Checker
Cleaned Palindrome Checker
Given a string, determine whether it is a palindrome after removing all non-alphanumeric characters and ignoring case differences. That is, the string is considered a palindrome if, after cleaning, it reads the same forward and backward.
The mathematical condition for a palindrome can be expressed as: $$s = s^R$$ where $$s^R$$ is the reverse of the cleaned string \(s\).
inputFormat
The input consists of a single line containing the string to check. The string may contain spaces, punctuation, and mixed case letters.
outputFormat
Output a single line: "True" if the cleaned string is a palindrome and "False" otherwise.
## sampleA man, a plan, a canal: Panama
True