In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.

Ex Input:
fpffftpffft

Ex Output:
fpf


Ex Input:
faccffaaaafccac

Ex Output:
faaaaf


Ex Input:
owwfffwwfoofw

Ex Output:

wwfffww



In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.

Ex Input:
fpffftpffft

Ex Output:
fpf


Ex Input:
faccffaaaafccac

Ex Output:
faaaaf


Ex Input:
owwfffwwfoofw

Ex Output:

user
wwfffww



assistant
In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.

Ex Input:
fpffftpffft

Ex Output:
fpf


Ex Input:
faccffaaaafccac

Ex Output:
faaaaf


Ex Input:
owwfffwwfoofw

Ex Output:

wwfffww


