diff options
| author | mo khan <mo.khan@gmail.com> | 2020-08-12 20:40:08 -0600 |
|---|---|---|
| committer | mo khan <mo.khan@gmail.com> | 2020-08-12 20:40:08 -0600 |
| commit | 7a925d251bc088f8e5091139a7953338a0784cad (patch) | |
| tree | 102a79deac6af3dae74b1ff00f328c6ce94ae5b1 /2020 | |
| parent | 7f7f9ea35f3bfe9749bb48ee9ac3ec9ae737891c (diff) | |
Add problem of the day
Diffstat (limited to '2020')
| -rw-r--r-- | 2020/08/12/README.md | 23 |
1 files changed, 23 insertions, 0 deletions
diff --git a/2020/08/12/README.md b/2020/08/12/README.md new file mode 100644 index 0000000..5396723 --- /dev/null +++ b/2020/08/12/README.md @@ -0,0 +1,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 +``` |
