Palindrome or Not

Java program to Check Whether a Number is Palindrome or Not using for, while, do-while, method and without user interaction.

There are different ways to Check Whether a Number is Palindrome or Not in Java.

1.          Check Number is Palindrome or Not using For Loop
2.          Check Number is Palindrome or Not using While Loop
3.          Check Number is Palindrome or Not using Do-While Loop
4.          Check Array elements are Palindrome or Not
5.          Number is Palindrome or Not Without User Interaction

Program 1: Write a Java Program to Check Whether a Number is Palindrome or Not using For Loop

import java.util.Scanner;
public class PalindromeFor 
{
	public static void main(String[] args) 
	{
		int reminder,reverse=0,temp;
		Scanner scan = new Scanner(System.in);
		System.out.println("\nEnter a Number: ");
		int n = scan.nextInt();
		temp=n;
		for(;n!=0;)
		{
			reminder=n%10;
			reverse=reverse*10+reminder;
			n=n/10;
		}
		if(temp==reverse)
		{
			System.out.println("\n\n"+temp+" is a pallindrome");
		}
		else
		{
			System.out.println("\n\n"+temp+" is not a pallindrome");
		}
	}
}

Output 

Enter a Number: 
12321


12321 is a pallindrome

Program 2: Write a Java Program to Check Whether a Number is Palindrome or Not using While Loop  

import java.util.Scanner;
public class palindromeWhile 
{
	public static void main(String[] args) 
	{
		int reminder,reverse=0,temp;
		Scanner scan = new Scanner(System.in);
		System.out.println("\nEnter a Number: ");
		int n = scan.nextInt();
		temp=n;
			while(n>0)
			{
				reminder=n%10;
				reverse=reverse*10+reminder;
				n=n/10;
			}
		if(temp==reverse)
		{
			System.out.println("\n\n"+temp+" is a pallindrome");
		}
		else
		{
			System.out.println("\n\n"+temp+" is not a pallindrome");
		}
	}
}


Output
Enter a Number: 
456321

456321 is not a pallindrome

Program 3: Write a Java Program to Check Whether a Number is Palindrome or Not using Do-While Loop  

import java.util.Scanner;
public class PalindromeDoWhile 
{
	public static void main(String[] args) 
	{
		int reminder,reverse=0,temp;
		Scanner scan = new Scanner(System.in);
		System.out.println("\nEnter a Number: ");
		int n = scan.nextInt();
		temp=n;
			do
			{
				reminder=n%10;
				reverse=reverse*10+reminder;
				n=n/10;
			}while(n!=0);
		if(temp==reverse)
		{
			System.out.println("\n\n"+temp+" is a pallindrome");
		}
		else
		{
			System.out.println("\n\n"+temp+" is not a pallindrome");
		}
	}
}

Output
Enter a Number: 
99999

99999 is a pallindrome

Program 4: Write a Java Program to Check Whether a Array elements are Palindrome or Not  

import java.util.Scanner;
public class PalindromeArray 
{
public static void main(String[] args) 	
{
	Scanner scan = new Scanner(System.in);
	System.out.println("\nEnter how many nos u have to check:");
	int size=scan.nextInt();
	int numbers[] =new int[size];
	System.out.println("\nEnter Array of numbers to be checked");
	for(int i=0;i<size;i++)	
	{
		numbers[i] = scan.nextInt();
	}
	for(int i=0;i&ltnumbers.length; i++)	
	{
		int n1 = numbers[i];
		int reverseN1 = 0;
		int temp=0;				
		while(n1>0)	
		{
			temp =n1%10;
			n1=n1/10;
			reverseN1=reverseN1*10+temp;
		}
		if(numbers[i]==reverseN1) 
		{
		System.out.println("\n"+numbers[i]+ "  is pallindrome" );
		}
		else 
		{
		System.out.println("\n"+numbers[i]+ "  is  not a pallindrome");
		}
	}
}
}

Output
Enter how many nos u have to check:
5

Enter Array of numbers to be checked
123
4554
78987
951159
357357

123  is  not a pallindrome

4554  is pallindrome

78987  is pallindrome

951159  is pallindrome

357357  is  not a pallindrome

Program 5: Write a Java Program to Check Whether a Number is Palindrome or Not Without User Interaction  

public class ArrayPalindromeWithoutUserInteraction 
{
	public static void main(String[] args) 
	{
	int arrNumbers[] = new int[] {1441, 65, 22, 87, 121, 96358, 159951};	
	System.out.println("Array is\n{1441, 65, 22, 87, 121, 96358, 159951}");
	for(int i=0 ; i<arrNumbers.length;i++)
	{
		int n = arrNumbers[i];
		int reverseN = 0;
		int reminde=0;				
		while(n>0)
		{
			reminde =n%10;
			n=n/10;
			reverseN=reverseN*10+reminde;
		}
		if(arrNumbers[i]==reverseN)
		{
		System.out.println("\n"+arrNumbers[i]+ "  is pallindrome" );
		}
		else
		{
		System.out.println("\n"+arrNumbers[i]+ "  is  not a pallindrome");
		}
	}
	}
}

Output
Array is
{1441, 65, 22, 87, 121, 96358, 159951}

1441  is pallindrome

65  is  not a pallindrome

22  is pallindrome

87  is  not a pallindrome

121  is pallindrome

96358  is  not a pallindrome

159951  is pallindrome