import re

def palindrome_check(s):

s = re.sub(r'[^\w]', '', s)

if len(s) < 2:

return True

if s[0].lower() != s[-1].lower():

return False

return palindrome_check(s[1:-1])

- Pigeonhole Sort

- Selection Sort

- Stooge Sort

Date: October 10, 2018

Added:

- ### String

- Palindrome Checker

A palindrome is a word, number, phrase, or other sequence of characters which reads the same backward as forward, such as madam or racecar or the number 10201. (Wikipedia)

from allalgorithms.string import palindrome_check

str = "10201"

print(palindrome_check(str)

str = "test"

print(palindrome_check(str)

> Return True if string is a palindrome, False otherwise

- `string`: Input String

import unittest

from allalgorithms.string import palindrome_check

class TestSorting(unittest.TestCase):

def test_palindrome_check(self):

self.assertEqual(True, palindrome_check("a"))

self.assertEqual(True, palindrome_check("10201"))

self.assertEqual(False, palindrome_check("test"))

self.assertEqual(True, palindrome_check("Mr. Owl ate my metal worm"))

self.assertEqual(True, palindrome_check("Was it a car or a cat I saw?"))

self.assertEqual(False, palindrome_check("How are you?"))

if __name__ == "__main__":

unittest.main()