Breaking News: Grepper is joining You.com. Read the official announcement!

palindrome recursion

Bad Batfish answered on May 29, 2022 Popularity 9/10 Helpfulness 2/10

answer palindrome recursion

related Program to check palindrome using recursion

palindrome recursion

Comment

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");
    }
}

Popularity 9/10 Helpfulness 2/10 Language whatever

Source: stackoverflow.com

Tags: palindrome recursion whatever

Link to this answer
Share Copy Link

Contributed on May 29 2022

Bad Batfish

0 Answers Avg Quality 2/10

Closely Related Answers

Program to check palindrome using recursion

Comment

#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;
}

Popularity 9/10 Helpfulness 2/10 Language c

Source: www.interviewbit.com

Tags: c palindrome palind

Link to this answer
Share Copy Link

Contributed on Oct 04 2022

Ankit Deshmukh

0 Answers Avg Quality 2/10

palindrome recursion

Contents

More Related Answers

palindrome recursion

Closely Related Answers

Program to check palindrome using recursion

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.