Challenge 3: Palindrome Check — Possible Solution
====================================================================

word = "racecar"

is_palindrome = word == word[::-1]

print(is_palindrome)

Output:
True

WHY THIS WORKS AS AN ANSWER
------------------------------
word[::-1] is the same reversal slice used earlier in the chapter's
own string-reversal example — a step of -1 walks the string from end
to start, producing "racecar" reversed, which happens to also be
"racecar".

word == word[::-1] then compares the original string to its reversed
version directly. A palindrome is defined exactly as "reads the same
forwards and backwards," so this comparison is a literal, one-line
translation of that definition — no loop needed to walk the string
manually character by character from both ends, since slicing already
produces the fully reversed string in one step.

For a non-palindrome like "python", word[::-1] would produce "nohtyp",
the comparison would evaluate to False, and is_palindrome would be
False.