Longest Palindromic Substring | Dataford Interview Questions

Longest Palindromic Substring (LeetCode 5): return the longest palindromic substring of a string.

Asked in the Round 1 technical stage. Given after resume discussion; candidate notes it is a standard DP problem.

Contract

Implement longest_palindrome(s). The input is a non-empty string. Return its longest palindromic substring. If multiple substrings have the maximum length, return the one with the smallest starting index.

Constraints

1 <= len(s) <= 1000
s contains printable ASCII characters
If several answers have the same maximum length, return the one with the smallest starting index

Function Signature

def longest_palindrome(s):

Your question is Longest Palindromic Substring. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem