Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Update pallindrome.java #1

Open
wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Update pallindrome.java #1

wants to merge 1 commit into from

Conversation

pr4jwal-19
Copy link
Owner

This PR is for checking if a string is palindrome or not using a recursive function.

Fixes tarunsinghofficial#2752

`package com.prajwal;

public class PalindromeRecursive {
// Function to check if a string is a palindrome using recursion
static boolean isPalindrome(String str) {
// Base case: If the string is empty or has only one character, it's a palindrome
if (str.length() <= 1) {
return true;
}

        // Compare the first and last characters of the string
        if (str.charAt(0) == str.charAt(str.length() - 1)) {
            // If they match, check the substring between the first and last characters
            // by recursively calling isPalindrome on the substring
            return isPalindrome(str.substring(1, str.length() - 1));
        }

        // If the first and last characters don't match, the string is not a palindrome
        return false;
    }

    public static void main(String[] args) {
        String str = "racecar"; // Change this string as needed

        if (isPalindrome(str)) {
            System.out.print("Yes, it's a palindrome.");
        } else {
            System.out.print("No, it's not a palindrome.");
        }
    }

}`

This code is for checking if a string is palindrome or not using a recursive function.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

Pallindrome number using recursion java
1 participant