Thays Gama: https://www.linkedin.com/in/thaysgama/
Captura dos testes:
Endereço do desafio: https://edabit.com/challenge/iY6e9fMQSWi38J699
A palindrome is a series of letters or numbers that reads equivocally backwards.
Write a recursive function that determines whether a given string is a palindrome or not.
isPalindrome("Maneuquenam") ➞ true
isPalindrome("This phrase, surely, is not a palindrome!") ➞ false
isPalindrome("Eva, can I see bees in a cave?") ➞ true
- Symbols and special characters should be ignored.
- You are expected to solve this challenge via recursion.
- You can check on the Resources tab for more details about recursion in Java.
- A collection of challenges in recursion can be found via this link.