Loading your interview setup

Skip to content

Overview Resume Score

Practice

The Daily LarpCode Reps LarpTalk

Interview

Templates Sessions

recent

Loading

medium· 1d-dp Mock interview

Longest Palindromic Substring

Given a string `s`, return the longest contiguous substring that is a palindrome. If several have the maximum length, return the one that appears leftmost.

Examples

in: s = "babad"

out: "bab"

"aba" is also valid but "bab" is leftmost

Constraints

1 <= len(s) <= 1000
s consists of letters and digits

Hints

target: O(n^2) time⌘↩ run · ⇧⌘↩ submit