2020/08/12/README.md


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23

A palindrome is a sequence of characters
that reads the same backwards and forwards.

Given a string, s, find the longest palindromic
substring in s.

Example:

Input: "banana"
Output: "anana"

Input: "million"
Output: "illi"

```python
class Solution
  def longestPalindrome(self, s):
    # Fill this in.

# Test program
Solution().longestPalindrome("tracecars")
# racecar
```