Problem of the day
Determine if a given string ‘S’ is a palindrome using recursion. Return a Boolean value of true if it is a palindrome and false if it is not.
Note: You are not required to print anything, just implement the function. Example:Input: s = "racecar"
Output: true
Explanation: "racecar" is a palindrome.
The first and only line of the input contains string S.
Output format:
Return a boolean value True or False.
abbba
true
“abbba” is a palindrome
abcd
false
“abcd” is not a palindrome.
0 <= |S| <= 10^6
where |S| represents the length of string S.