You are given a string s. Your task is to check whether the string is a palindrome using recursion only. A string is called a palindrome if it reads the same forward and backward.
Return true if the string is a palindrome; otherwise, return false.
Example 1
Input: s = "madam"
Output: true
Explanation: The string reads the same from left to right and right to left.
Example 2
Input: s = "hello"
Output: false
Explanation: The string is different when reversed.
Example 3
Input: s = "a"
Output: true
Explanation: A single character is always a palindrome.
Sign in to write, run, and submit your solution against the full test suite.