Longest Palindromic Substring
MediumProblem Description
Given a string s, return the longest palindromic substring in s.
A palindrome is a string that reads the same forward and backward.
Examples
Example 1:
Input: s = "babad"
Output: "bab"
Explanation: "aba" is also a valid answer.
Example 2:
Input: s = "cbbd"
Output: "bb"
Constraints
1 <= s.length <= 1000sconsist of only digits and English letters.
Follow-up
Can you solve it in O(n²) time? What about O(n) time using Manacher's algorithm?
Solution
Test Results
Run tests to see the overall score, band, and section breakdown.
Public Tests
Detailed feedback for visible cases.
Public test details will appear here after you run your solution.
Hidden Tests
Summary only, with no hidden inputs or outputs.
Performance
Execution timing and pass/fail status.
No performance results yet.
AI Interviewer
I'll review your code once you submit it. I can also give you hints if you get stuck!