The task is to find the smallest palindrome greater than a given number.

• Iterate from the middle of the number and mirror the left side to form the palindrome.

• Handle cases where the number is already a...read more

import java.io.*;

class GFG

{

{

int n, k, rev = 0;

n = num;

while (num != 0) {

k = num % 10;

rev = (rev * 10) + k;

num = num / 10;

}

// check if num and its reverse are same

if (n == rev) {

return 1;

}

else {

return 0;

}

}

public static void main(String[] args)

{

int num = 9687;

while (isPalindrome(num) == 0) {

num = num + 1;

}

System.out.print("Next Palindrome : ");

System.out.print(num);

}

}