LeetCode Problem: 9. Palindrome Number | Java Solution

Problem Statement: Given an integer x, return true if x is a
palindrome, and false otherwise. | Java Solution

🎥 Complete playlist of LeetCode Problems

---------------------------------------------------------------------------------------------

Checkout other videos

🌎 Find Me Here:

#leetcode #leetcodesolution #leetcodequestionandanswers

[vishwas]

I started following your channel because of mern stack projects. It would be great if you solve DSA in javascript. I know language doesn't matter logic matters but still using map, set etc which is specific for javascript would be great to watch being a frontend developer or mern stack developer. There are plenty of channels for dsa in Java but for JS it's not there

[arunaditya]

Better solution
int originalNumber = x;
int reverse = 0;
if(x != 0 && x % 10 == 0)
return false;

while(x > reverse){
reverse = reverse * 10 + x%10;
x = x / 10;
}

return x == reverse || x == reverse / 10;