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.

Let me give you an example: gocogccocco
The answer to this example can be: gocog
Here is why: The substring 'gocog' is the longest possible substring that is also a palindrome. So this is a good example.

OK. solve this:
gfgzfzggzgg
Answer:
gzfzg
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.

Let me give you an example: gocogccocco
The answer to this example can be: gocog
Here is why: The substring 'gocog' is the longest possible substring that is also a palindrome. So this is a good example.

OK. solve this:
gfgzfzggzgg
Answer:
user
gzfzg
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.

Let me give you an example: gocogccocco
The answer to this example can be: gocog
Here is why: The substring 'gocog' is the longest possible substring that is also a palindrome. So this is a good example.

OK. solve this:
gfgzfzggzgg
Answer:
gzfzg