File: root - text - article - 2019 - 10 - daily-problem-twitter-palindrome.txt
Tags: 每日算法, 回文数, 面试, Python, daily problem, palindrome, algorithms, twitter interview question, python, | English | Home Page | Category: Computing | 572 Views, 19067 Search Bots | 69 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法, 回文数, 面试, Python, daily problem, palindrome, algorithms, twitter interview question, python, | English | Home Page | Category: Computing | 572 Views, 19067 Search Bots | 69 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
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"
Tags: 每日算法, 回文数, 面试, Python, daily problem, palindrome, algorithms, twitter interview question, python, | English | Home Page | Cateogry: Computing | 572 Views, 19067 Search Bots | 69 Words 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
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- [Daily Problem] Remove Consecutive Nodes that Sum to 0
- Windows Scripting
- Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
- Binary Tree Level with Minimum Sum
- Algorithm Interview: No Adjacent Repeating Characters
- A trick for getting good at coding interviews FASTER
- Batch Programming in XP
- Daily Interview Problem: Minimum Removals for Valid Parenthesis
- Daily Interview Question: Word Search
- Staying on a Chess Board
©2006~2024 SteakOverCooked - 0.01041 Seconds(s) - 5115.957 KB/s - 33 Online
Memory: 529.28 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !