Longest Palindromic Substring
Try to solve the Longest Palindromic Substring problem.
We'll cover the following
Statement
Given a string s, return the longest palindromic substring in s.
Note: If there are multiple valid palindromic substrings of the same length, return any of them.
Constraints
-
s.length -
sconsist of only digits and English letters.
Examples
Level up your interview prep. Join Educative to access 80+ hands-on prep courses.