Search⌘ K
AI Features
Home
Courses
Recursion for Coding Interviews in C++

Solution Review 2: Is this String a Palindrome?

Explore how to identify palindromes in strings using recursion in C++. Learn the roles of the base and recursive cases through a detailed code walkthrough that involves checking string indices from front and back, enabling you to grasp the recursive approach for string manipulation.

We'll cover the following...

Solution: Palindrome or not?

C++
#include <iostream>
#include <string>
using namespace std;
bool isPalindrome(string text) {
        if (text.size() <= 1) {
            return true;
        }
        else {
            if (text[0] == text[text.size()-1]) {
                return isPalindrome(text.substr(1, text.size()-2));
            }
        }
        return false;
    }
int main() { 
        string input1 = "toot";
        string input2 = "dadad";
        bool answer1 = isPalindrome(input1);
        bool answer2 = isPalindrome(input2);
        cout << "Is " << input1 << " a Palindrome? = " << answer1 << endl;
        cout << "Is " << input2 << " a Palindrome? = " << answer2 << endl;
}

Understanding the Code

Every recursive code has two functions; the recursive function and the main function.

Driver

...