Java: Find next smallest palindrome

Last update on May 15 2025 13:08:30 (UTC/GMT +8 hours)

Next Smallest Palindrome

Write a Java program to find the next smallest palindrome.

Sample Solution:

Java Code:

import java.util.*;

class solution {

    public static int nextPalindromeGenerate(int n)
    {   
        int ans=1, digit, rev_num=0, num;                
       //For single digit number, next smallest palindrome is n+1       
	   if(n<10)
        {   
            ans=0;
			return n+1;
        }

        num=n;
        while(ans!=0)
        {   rev_num=0;digit=0;
            n=++num;

            while(n>0)      //rev_numersing the number
            {
                digit=n%10;
                rev_num=rev_num*10+digit;
                n=n/10;
            }

            if(rev_num==num)   
            {
                ans=0;
				return num;
            }

            else ans=1;
        }
		return num;
    }

    public static void main(String[] args)
    {   
       Scanner scan = new Scanner(System.in);
       System.out.print("Input the number: ");
       int n = scan.nextInt();
       if (n>0)
		{	
		 System.out.println("Next smallest palindrome:" + nextPalindromeGenerate(n));
		}         
   }
}

Sample Output:

Input the number:  121
Next smallest palindrome:131

Flowchart:

$Flowchart: Find next smallest palindrome.$

For more Practice: Solve these Related Problems:

Write a Java program to find the next palindrome greater than a given number using string reversal.
Write a Java program to generate the next smallest palindrome by mirroring the left half and adjusting the center digit.
Write a Java program to compute the next palindrome using arithmetic operations without converting the number to a string.
Write a Java program to find the next smallest palindrome ensuring the digit length remains constant.

Go to:

PREV : Max Distinct Prime Factors in Range.
NEXT : Evaluate Polynomial Efficiently.

Java Code Editor:

Contribute your code and comments through Disqus.