Recursive Palindrome

Decide whether text reads the same forwards and backwards, considering only letters and digits and ignoring case. Solve it recursively: compare the outer characters, then check the inside.

Implement is_palindrome_recursive(text).

Input

text: The text to check (ASCII characters).

Output

Return true for a palindrome, otherwise false.

Vincoli

0 ≤ length ≤ 1,000

Esempi

Input:
text = "Never odd or even"

Output atteso:
expected = True

Input:
std::string text = "Never odd or even";

Output atteso:
bool expected = true;

Input:
string text = "Never odd or even";

Output atteso:
bool expected = true;

Input:
text = "code"

Output atteso:
expected = False

Input:
std::string text = "code";

Output atteso:
bool expected = false;

Input:
string text = "code";

Output atteso:
bool expected = false;

Riferimenti

Questa sfida è adattata per CodeUtility. Segui la traccia e i vincoli sopra.

• Fordham CS1600 Computer Science I - schedule and labs