Longest Palindromic Substring | Dataford Interview Questions

Given a string, find the longest palindromic substring.

Return the substring itself. A palindrome reads identically from left to right and right to left. If multiple palindromic substrings have the same maximum length, return any one. The input is a non-empty string containing printable characters.

Function signature: def longest_palindrome(s):

Constraints

1 <= len(s) <= 1000
s contains printable characters
If several answers have the same maximum length, return any one

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

Given a string, find the longest palindromic substring.

Function signature: def longest_palindrome(s):

Constraints

1 <= len(s) <= 1000
s contains printable characters
If several answers have the same maximum length, return any one

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.