HardPython ProgrammingHigh School (9–10)High School (11–12)UndergraduateGeneralPython Essentials › RecursionPython-Coded
Write is_palindrome(text) by recursion. A text is a palindrome if its first and last letters are…
Contributed by StemPy LabTry it on paper first. A hint, the key idea and the worked solution are here when you need them.
Write is_palindrome(text) by recursion. A text is a palindrome if its first and last letters are the same and the text between them is a palindrome. What are the answers for level, python and noon?
Need a reminder? The key ideaShow
Compare the two ends, then check the middle.
The worked solution
Have you tried it?
Work it out on paper first. It is fine to get stuck or make a mistake: that is how we learn. When you are ready, compare your working with the solution.
Base case. A text of one letter or none is a palindrome: True.
Recursive cases. If the first and last letters differ, it is False. Otherwise check the text between them: text[1:-1].
level:l = l, theneve:e = e, thenv:True.python:pandndiffer:False.noon:n = n, thenoo:o = o, then nothing:True.
Discussion (0)
Log in to join the discussion.
Loading…