SDE Path

Check if a String Is a Palindrome Using Recursion

Easy

Check if a String Is a Palindrome Using Recursion

Determine whether a given string is a palindrome using recursion.

Input format

A single line containing a lowercase string (length ≤ 400).

Output format

Print true if the string is a palindrome, otherwise false.

Constraints

  • Values fit in a 64-bit signed integer
  • Trailing whitespace and a trailing newline are ignored by the judge

Read from stdin, write to stdout. Sample cases below show the exact format.

Sample cases

Example 1
Input
madam
Expected output
true
Example 2
Input
hello
Expected output
false