Skip to content

problem14.md

Latest commit

 

History

History
14 lines (10 loc) · 356 Bytes

problem14.md

File metadata and controls

14 lines (10 loc) · 356 Bytes

Problem 14: The Palindrome Detective (Check Palindrome Recursively)

Problem Statement

Given a string s, determine whether it is a palindrome using recursion. Consider only alphanumeric characters and ignore case.

Input Format

  • A string s.

Example

Input: s = "racecar"
Output: True

Input: s = "hello"
Output: False