Need code for this problem!!!
Please help!!!
Problem 5
Given a string, find the longest substring that is a palindrome. If there are multiple such strings print the
lexicographically smallest substring.
Input:
One string per line.
Length of the string < 10,000
Output:
The longest palindrome substring per line.
Example:
Sample Input:
aabcdcbop
bbccaa
Sample Output:
bcdcb
aa
Problem 5
Given a string, find the longest substring that is a palindrome. If there are multiple such strings print the
lexicographically smallest substring.
Input:
One string per line.
Length of the string < 10,000
Output:
The longest palindrome substring per line.
Example:
Sample Input:
aabcdcbop
bbccaa
Sample Output:
bcdcb
aa
Topic archived. No new replies allowed.