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.

Restricciones

0 ≤ length ≤ 1,000

Ejemplos

Entrada:
text = "Never odd or even"

Salida esperada:
expected = True

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

Salida esperada:
bool expected = true;

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

Salida esperada:
bool expected = true;

Entrada:
text = "code"

Salida esperada:
expected = False

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

Salida esperada:
bool expected = false;

Entrada:
string text = "code";

Salida esperada:
bool expected = false;

Referencias

Este reto está adaptado para CodeUtility. Sigue el enunciado y las restricciones indicadas arriba.

• Fordham CS1600 Computer Science I - schedule and labs