import java.util.Scanner;

public class Palindromes

{

​

    public static boolean isPal(String s)

    {

        if(s.length() == 0 || s.length() == 1)

            // if length =0 OR 1 then it is

            return true; 

        if(s.charAt(0) == s.charAt(s.length()-1))

            // check for first and last char of String:

            // if they are same then do the same thing for a substring

            // with first and last char removed. and carry on this

            // until you string completes or condition fails

            return isPal(s.substring(1, s.length()-1));

​

        // if its not the case than string is not.

        return false;

    }

​

    public static void main(String[]args)

    {

        Scanner sc = new Scanner(System.in);

        System.out.println("type a word to check if its a palindrome or not");

        String x = sc.nextLine();

        if(isPal(x))

            System.out.println(x + " is a palindrome");

        else

            System.out.println(x + " is not a palindrome");

    }

}

#include <stdio.h>

#include <conio.h>

int reverse(int num);

int isPalindrome(int num);

int main()

{

    int num;

    printf("Enter a number: ");

    scanf("%d", &num);

if(isPalindrome(num) == 1)

{

 printf("the given number is a palindrome");

    }

    else

    {

        printf("the given number is not a palindrome number");

   }

    return 0;

}

​

int isPalindrome(int num)

{

    if(num == reverse(num))

    {

        return 1;

    }

    return 0;

}

int reverse(int num)

{

int rem;

    static int sum=0;

    if(num!=0){

            rem=num%10;

            sum=sum*10+rem;

            reverse(num/10);

    }

        else

             return sum;

    return sum;

}