Leetcode Problems Analysis and Solutions in Java.
Interview Questions, Algorithms and Data Structures.
Monday, July 7, 2014
[Leetcode] Longest Palindromic Substring
Problem
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.
No comments:
Post a Comment