Saturday, December 19, 2015

5. Longest Palindromic Substring

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.

Java Code:
Posted by at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)