LeetCode OJ
Sign up Sign in

Longest Palindromic Substring

Total Accepted: 3081 Total Submissions: 14579 My Submissions

Given a string S, find the longest palindromic substring in S. You may assume that the maximum length of S is 1000, and there exists one unique longest palindromic substring.

Discuss

You have not signed in, cannot submit your code.
Submit failed, try again please.
You have attempted to resubmit too soon. Please resubmit in a moment.
Send Feedback