5. Longest Palindromic Substring
Problem Statement
Given a string s
, return the longest
palindromic substring in s
.
Example 1:
Example 2:
Constraints:
1 <= s.length <= 1000
s
consist of only digits and English letters.
Intuition
Links
Video Links
Approach 1:
Approach 2:
Approach 3:
Approach 4:
Similar Problems
Last updated