Longest Palindromic Substring | Dataford Interview Questions

Given a string, find the length of the longest palindrome substring.

Asked in the phone screen stage. Problem #2.

Implement longest_palindrome_length(s), which accepts a string and returns an integer containing the maximum length of any contiguous substring that reads identically forward and backward. Return 0 for an empty string.

Constraints

0 <= s.length <= 1000
The string contains only lowercase English letters

Function Signature

def longest_palindrome_length(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 length of the longest palindrome substring.

Asked in the phone screen stage. Problem #2.

Constraints

0 <= s.length <= 1000
The string contains only lowercase English letters

Function Signature

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