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.

Examples:

					
#Example 1
Input: "babad"

Output: "bab"
#Note: "aba" is also a valid answer.

#Example 2
Input: "cbadacqrpbd"

Output: "ada"
				

Hints and Answer Checklist