#K64352. Taco Palindrome Checker
Taco Palindrome Checker
Taco Palindrome Checker
Given a string s, determine whether it is a palindrome. In this problem, a palindrome is defined as a string that reads exactly the same backwards as forwards, taking into account all spaces, punctuation, and capitalization.
For example, the string "madam" is a palindrome, but "hello" is not. Note that even if a sentence may look like a palindrome after ignoring case or non-alphabetical characters, you are required to perform an exact character-by-character comparison.
You need to read the input from standard input and output the result to standard output. The output should be True
if the input string is a palindrome, and False
otherwise.
inputFormat
The input consists of a single line containing a string s. The string may include spaces, punctuation, and mixed case letters.
outputFormat
Output a single line with either True
if the string is a palindrome (it reads the same backwards), or False
otherwise.
madam
True