Created
August 16, 2019 06:09
Write a recursive function, is_palindrome() to find out whether a string is a palindrome or not. The function should return true, if it is a palindrome. Else it should return false. Note- Perform case insensitive operations wherever necessary. Also write the pytest test cases to test the program.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#PF-Assgn-40 | |
def is_palindrome(word): | |
word=word.lower() | |
if(len(word)==1): | |
return True | |
elif(len(word)==2): | |
if(word[0]==word[1]): | |
return True | |
else: | |
return False | |
elif(len(word)>2 and word[0]==word[-1]): | |
word=word[1:-1] | |
result=is_palindrome(word) | |
if(result): | |
return True | |
else: | |
return False | |
else: | |
return False | |
#Remove pass and write your logic here | |
#Provide different values for word and test your program | |
result=is_palindrome("mm") | |
if(result): | |
print("The given word is a Palindrome") | |
else: | |
print("The given word is not a Palindrome") |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment