Palindrome Number Check

Given an integer, determine if it is a palindrome. An integer is a palindrome if it reads the same forward and backward. For example, 121 is a palindrome; -121 and 10 are not. Return True or False.

Just like reversing a number, we extract digits one by one using modulo. We don't need to fully reverse the number — we can compare the reversed number to the original. Negative numbers are never palindromes (due to the plus sign), and numbers ending in 0 (except 0 itself) are never palindromes.

1. Return False immediately for negative numbers.
2. Return False for numbers that end in 0 but aren't 0 themselves.
3. Extract digits one at a time to build reversed_num.
4. Compare reversed_num with the original n — if equal, it's a palindrome.

• Converting to a string (str(n) == str(n)[::-1]) — valid but not a true mathematical solution
• Not handling negative numbers: they have a - prefix so can never be palindromes
• Not handling numbers ending in 0: 10 reversed is 01 = 1, not 10, so it's not a palindrome

This builds directly on Day 1 (Reverse Number). A palindrome check is a reversal check — the reversed number equals the original. The early exits for negatives and trailing zeros make the solution more robust.