696. Check Palindrome Using Recursion

Given a string s, return true if it is a palindrome, false otherwise. Use recursion — compare the first and last characters, then recurse on the inner substring. The check is case-sensitive.

Input: A single string s (0 ≤ len(s) ≤ 1000).

Output: A boolean: true if s is a palindrome, false otherwise.

Examples

Input: "racecar"
Output: true
Explanation: "racecar": r==r, so check "aceca": a==a, check "cec": c==c, check "e": length 1 → true.

Input: "hello"
Output: false
Explanation: "hello": h≠o → immediately false.

Input: "a"
Output: true
Explanation: Single character is always a palindrome.

Constraints

• 0 <= len(s) <= 1000

Asked by