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

palindrome using recursion in java

Aditya Trivedi answered on November 5, 2022 Popularity 8/10 Helpfulness 2/10

answer palindrome using recursion in java

related java program to check palindrome number using recursion

palindrome using recursion in java

Comment

// A recursive JAVA program to
// check whether a given String
// is palindrome or not
import java.io.*;
 
class GFG
{
    // A recursive function that
    // check a str(s..e) is
    // palindrome or not.
    static boolean isPalRec(String str,
                            int s, int e)
    {
        // If there is only one character
        if (s == e)
            return true;
 
        // If first and last
        // characters do not match
        if ((str.charAt(s)) != (str.charAt(e)))
            return false;
 
        // If there are more than
        // two characters, check if
        // middle substring is also
        // palindrome or not.
        if (s < e + 1)
            return isPalRec(str, s + 1, e - 1);
 
        return true;
    }
 
    static boolean isPalindrome(String str)
    {
        int n = str.length();
 
    // An empty string is
    // considered as palindrome
        if (n == 0)
            return true;
 
        return isPalRec(str, 0, n - 1);
    }
 
    // Driver Code
    public static void main(String args[])
    {
        String str = "geeg";
 
        if (isPalindrome(str))
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}

Popularity 8/10 Helpfulness 2/10 Language java

Source: Grepper

Tags: java palindrome recursion using

Link to this answer
Share Copy Link

Contributed on Nov 05 2022

Aditya Trivedi

0 Answers Avg Quality 2/10

Closely Related Answers

java program to check palindrome number using recursion

Comment

// Recursive Java program to
// check if the number is
// palindrome or not
import java.io.*;

class GFG
{

// recursive function that
// returns the reverse of digits
static int rev(int n, int temp)
{
	// base case
	if (n == 0)
		return temp;

	// stores the reverse
	// of a number
	temp = (temp * 10) + (n % 10);

	return rev(n / 10, temp);
}

// Driver Code
public static void main (String[] args)
{
	int n = 121;
	int temp = rev(n, 0);
	
	if (temp == n)
		System.out.println("yes");
	else
		System.out.println("no" );
}
}

// This code is contributed by anuj_67.

Popularity 8/10 Helpfulness 1/10 Language java

Source: www.geeksforgeeks.org

Tags: using recursion java palindrome

Link to this answer
Share Copy Link

Contributed on Dec 23 2022

Pratik Lonari

0 Answers Avg Quality 2/10

palindrome using recursion in java

Contents

More Related Answers

palindrome using recursion in java

Closely Related Answers

java program to check palindrome number using recursion

Grepper

Documentation

Social

Legal

Contact

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