Longest Palindromic Substring | Dataford Interview Questions

Implement a function to find the longest palindromic substring in a string.

Define def longest_palindromic_substring(s):, where s is a string and the function returns the longest contiguous palindromic substring; return "" for empty input. For equal-length answers, return the one that appears first, such as "babad" producing "bab"; constraints are 0 <= len(s) <= 1000 and s contains printable characters.

Constraints

0 <= len(s) <= 1000
s contains printable characters
Return a contiguous substring of s
If multiple longest palindromes exist, return the one with the smallest starting index

Function Signature

def longest_palindromic_substring(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

Implement a function to find the longest palindromic substring in a string.

Constraints

0 <= len(s) <= 1000
s contains printable characters
Return a contiguous substring of s
If multiple longest palindromes exist, return the one with the smallest starting index

Function Signature

def longest_palindromic_substring(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.