// Time Complexity: O(logN), Auxiliary Space: O(1) import java.io.*; import java.util.*; public class CheckPalindrome { static boolean isPal(int n) { int rev = 0; int temp = n; // reversed integer is stored in reversed variable while(temp != 0) { int ld = temp % 10; rev = rev * 10 + ld; temp = temp / 10; } // palindrome if orignal and reversed are equal return rev==n; } public static void main (String[] args) { int number = 4553; System.out.println(isPal(number)); } }