You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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.

gocogccocco
Solution: gocog
Why? The substring 'gocog' is the longest possible substring that is also a palindrome. So this is a good example.

New input: ififfdiiffdd
Solution:
ifi