Your question is Palindrome Coding in Python. Start with the requirements on the right.
Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.
GEP SMART may validate short text identifiers before processing them. Write a function that determines whether a given string is a palindrome, meaning it reads the same from left to right and right to left.
Compare characters exactly. The comparison is case-sensitive, and spaces, punctuation, and other characters are treated as ordinary characters. Return True when the string is a palindrome and False otherwise.
Implement is_palindrome(s), where s is a Python string. Return a Boolean value. An empty string and a single-character string are palindromes.
def is_palindrome(s):