[Daily Problem] Longest Palindromic Substring

文件: root - text - article - 2019 - 10 - daily-problem-twitter-palindrome.txt
标签: 每日算法, 回文数, 面试, Python, daily problem, palindrome, algorithms, twitter interview question, python, | 英文 | 主页 | 类别: 计算机科学 | 348 次阅读, 17392 次搜索 | 69 个单词

| 浏览 | 博客存档

Hi, here's your problem today. This problem was recently asked by Twitter:

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"



class Solution: 

    def longestPalindrome(self, s):

      # Fill this in.

        

# Test program

s = "tracecars"

print(str(Solution().longestPalindrome(s)))

# racecar