Palindrome Number Problem

Palindrome Number Problem — ExecCode Easy DSA Practice

Solve the Palindrome Number problem on ExecCode. Free online easy DSA practice in Arrays - Basics. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Given an integer x, return true if x is a palindrome integer (reads the same forward and backward). Negatives are not palindromes.

Examples

Input x = 121; Output true. Input x = -121; Output false

Constraints

-2^31 ≤ x ≤ 2^31 - 1

Practice Palindrome Number free on ExecCode. Browse DSA problems, topic map, and placement guides.