Recursion

Thinking Recursively

Step 2: Combine solutions with simpler inputs to a solution of the original problem.
Don't worry how those solutions are obtained. These are simpler inputs, so someone else will solve the problem for you.
Removing the first and last characters seems promising:
```
"rotor"
```
becomes
```
"oto"
```
A word is a palindrome if
- the first and last letters match
- the word obtained by removing the first and last letters is a palindrome.