Merge pull request larymak#89 from aldotele/add_recursive_palindrome

[FEAT]: recursive palindrome challenge

Author: larymak

RecursivePalindrome/README.md

@@ -0,0 +1,7 @@
+### Is it a Palindrome?
+A word (or sentence) is a palindrome when reading it from right to left is the same as from left to right.
+For example: **level** is a palindrome.
+
+The code uses recursion in order to iteratively compare the first and last element of the string,
+gradually reducing the string until the middle of it.
+Recursion is used when you do not know in advance how many iterations you need in order to get a solution.

RecursivePalindrome/main.py

@@ -0,0 +1,22 @@
+def isPalindrome(s):
+ s = s.lower().replace(' ', '') # this allows working on sentences as well
+ if s == '' or len(s) == 1:
+ return True
+ else:
+ if s[0] != s[-1]:
+ return False
+ s = s[1:-1]
+ return isPalindrome(s) # note: we might delete s = s[1:-1] and write directly return isPalindrome(s[1:-1])
+
+
+def main():
+ word = input('enter a string: ')
+ print('is that a palindrome?')
+ if isPalindrome(word):
+ print("Yep")
+ else:
+ print("Nope")
+
+
+if __name__ == '__main__':
+ main()