input
stringlengths 551
556
| output
sequencelengths 1
1
| id
stringlengths 40
40
|
|---|---|---|
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zlzpzzplpp
Output:
| [
"pzzp"
] | task850-693a44c7df20429d85c0fea678755ae6 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: iyzzziiiyiz
Output:
| [
"zzz"
] | task850-a76910f7131b4fce8ef3cc1cb7c5d38f |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: hxexexeheeex
Output:
| [
"xexex"
] | task850-d688f4f7f8824c0bb646a96dc5e4a898 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ybvbbvybbbb
Output:
| [
"vbbv"
] | task850-4ff13fcc0d1e4635b4d201d82d015b73 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zeezeeeelez
Output:
| [
"eezee"
] | task850-e0ece70effed48b9a757b0fdc9b77397 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zzlzluzuuzlul
Output:
| [
"zuuz"
] | task850-4d6fb3681aaa41c98e5ff2f85e861eff |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: epeetteettp
Output:
| [
"eettee"
] | task850-21f4ae706caa4d5d921f0d639db16dea |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: sessskseksessek
Output:
| [
"esse"
] | task850-f783c74c44db46d2b2b2bc21f20311bc |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: wwqwlllwwqlwwl
Output:
| [
"wlllw"
] | task850-8063a701d1dc4f5194c514bd36c0ca32 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zzzzyyyyzyzzzz
Output:
| [
"zyyyyz"
] | task850-6c498c7ce948470daa154f20d69ddbbe |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: llglccgllll
Output:
| [
"llll"
] | task850-cfea676c85ad4191949ff725daea20d2 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: tdtdttytddy
Output:
| [
"tdtdt"
] | task850-f0717550367b43eaa27aa462dda81473 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ktaaaktttaatat
Output:
| [
"taat"
] | task850-e5ec061a625e4fb6b608eb94fdae4198 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: sssmszsmmmszzs
Output:
| [
"zsmmmsz"
] | task850-173eeb8fe12a4d8d8a6f381f76ead40e |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: eckeekeeeccc
Output:
| [
"eekee"
] | task850-0c9dd8eeccca48e0a6d500af53cd7f11 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ggnngnogooooo
Output:
| [
"ooooo"
] | task850-251ce97bc65d4f8fb5c9a8d4c70bc429 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: jbjjijijiibj
Output:
| [
"jijij"
] | task850-a2dc69710e044322a289e9badb31dbb1 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: uzuuzzzuoz
Output:
| [
"uzzzu"
] | task850-d5681f8743944abd8d09757232ee0699 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: hvvddvddhd
Output:
| [
"ddvdd"
] | task850-670866bdcdb94c28bec849ff30ba9ea2 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: yxyxxyyxvxy
Output:
| [
"yxvxy"
] | task850-0a32ef075b6242ec8dd976a25a03ea80 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zjejzzeejzjjzzj
Output:
| [
"zjejz"
] | task850-0a0ffe6f8d074181bb64ac982a6fbb03 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zuzfzuzzffzuz
Output:
| [
"zuzfzuz"
] | task850-d9995ef6ae134afd9f92d4db9f20bca3 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: wxxwxxxxww
Output:
| [
"wxxxxw"
] | task850-d15caab9e9204d4286b446e53f378f2b |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: nttjjjjjtn
Output:
| [
"tjjjjjt"
] | task850-0c574b534d2e49079a01e5c0de566699 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: oyocycoyoy
Output:
| [
"oyocycoyo"
] | task850-558ff51b678b46138bd870268b6d7464 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: lnaanlnlallaaal
Output:
| [
"lnaanl"
] | task850-57a7540dd5f44f7ea591c6286b85365b |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: eieeiwewweee
Output:
| [
"ieei"
] | task850-02edc0829fd54d5a8bcc144d7d403fdc |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: jjqbjqjbjbqj
Output:
| [
"bjqjb"
] | task850-2ba8c1ec19b7487e81ee322d07ee2c84 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: jtfjjftfff
Output:
| [
"tfjjft"
] | task850-46d4ee75e6b94171805ea3cd58797aed |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: nwwnwcwwwnwww
Output:
| [
"wwwnwww"
] | task850-bbd0e55e33b34e62804a92a90e70eeb3 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: azaaazzzzzz
Output:
| [
"zzzzzz"
] | task850-b46cc8b06796489c8df2265437d14f2c |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: llljljjllj
Output:
| [
"ljjl"
] | task850-b7e8308aa7c04edc81e51ab129c1be0b |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: lllieeellill
Output:
| [
"llill"
] | task850-64f3fb0499fa4fd896fa6e1a3b4afdfe |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: cxmcxcxmcmcx
Output:
| [
"cxc"
] | task850-64d4f945140f4244a39fd37297b8c65c |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ssststyysyy
Output:
| [
"yysyy"
] | task850-8b264cfb8ae04202afd50bb6847a9782 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: rllllzlllzl
Output:
| [
"lllzlll"
] | task850-5ac3c24dbf984a3bb67287ccc08cf2f0 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: mttfftfmtffmm
Output:
| [
"tfft"
] | task850-e6e559f1320e4fc891b65ea0ab6d7ff8 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: gemgegeemm
Output:
| [
"geg"
] | task850-8c85d3a73f3c440f9f0febe134c23b5c |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: wowvwoooowow
Output:
| [
"woooow"
] | task850-7357b57b8c0441e59486036328554fb6 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: sjxxsjjjxxxj
Output:
| [
"jxxxj"
] | task850-70f531629c424fa3b2fc3e2347847412 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: bbnnbzznzbbn
Output:
| [
"bnnb"
] | task850-450fbadbc4e34e3f80502325c7adbc41 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: siiysyyiis
Output:
| [
"ysy"
] | task850-9e066bfdcd9247e8b392a5d590e54cb2 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: hrhdrhhrhdd
Output:
| [
"rhhr"
] | task850-6eeb15b004634bf6a2423cd9386ae13d |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ayaaymyyaaamymm
Output:
| [
"yaay"
] | task850-6f7f273688724a03a7f8f03ab858e853 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: dndednndnendded
Output:
| [
"ndedn"
] | task850-2fd68415e6754e1980910d86208d878d |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: spsppppvppvv
Output:
| [
"ppvpp"
] | task850-d9e24804ad5b47e387e4b2f6cdc0ae78 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ererreeorr
Output:
| [
"erre"
] | task850-4601a6e1770640f7955bf4ffd7033f46 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: qwwqcqwccqc
Output:
| [
"wqcqw"
] | task850-3916591a58194fb6b4ef5d754539ebb9 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ensseensese
Output:
| [
"ses"
] | task850-faa009a6e6274f47b78c39ee7437fa5b |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ppjpsspssp
Output:
| [
"psspssp"
] | task850-4829917022b942b481c5505dbc2da183 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: gjjgjggjgcgcgcc
Output:
| [
"gjggjg"
] | task850-421661ca793e433a9bc5fc8425ae2090 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: hihhhihihh
Output:
| [
"hihhhih"
] | task850-71db78acb7944df4a3e404f50d48bb71 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: hhhpphpplph
Output:
| [
"pphpp"
] | task850-90a07adba4c84c358597045c93a252b4 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: vgyvvggyyvvvggv
Output:
| [
"vggv"
] | task850-2c0a1c8b08df4bdaa87abac53f5bd2d7 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: qtmmqqqtmtt
Output:
| [
"qqq"
] | task850-5f83cb9fc4354a45990f77fde4a841fc |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: tjttjojtoojjtj
Output:
| [
"tjojt"
] | task850-79c567e3fbac47baa94cb6066ea6078a |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: eeemxmemme
Output:
| [
"emxme"
] | task850-cda3aed252f046aa968c97fa9546df67 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: wqqqwwqmqq
Output:
| [
"wqqqw"
] | task850-c47d69f801db4875953e6313d1c9c8cd |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ysyysseeyeyesyy
Output:
| [
"eyeye"
] | task850-e00daad48c2744a8b4ed58d0a7165bc7 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zuuzzsszzzzuz
Output:
| [
"zzsszz"
] | task850-266c8695e0a94dd0b48e9f878c699a56 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: spsprsrsrps
Output:
| [
"sprsrsrps"
] | task850-4134712ea3c945d8b5a852afeeecdd67 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: tktttctctkktkt
Output:
| [
"tctct"
] | task850-0be4b6e00499467bb88483a97a458ef4 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: mtstssmtmmmtmm
Output:
| [
"mtmmmtm"
] | task850-8ea5b26cc0304b8e82186cfb4b403aed |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: pvvpppkppp
Output:
| [
"pppkppp"
] | task850-289b72cf342647abbbad0876194157bb |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: erjejererrej
Output:
| [
"erre"
] | task850-b3c4a055065548049203df5086e4c097 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zzzzzvzvzzzvzvz
Output:
| [
"zvzvzzzvzvz"
] | task850-0099c3b3875844c9b27f0d8f0fbd8dd3 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zmdzdzzzmdmzzdm
Output:
| [
"zzmdmzz"
] | task850-cff70b55ef0745c6926eae399e40c397 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: tflttftlfltff
Output:
| [
"ftlfltf"
] | task850-4da39f829e8a4ebca833e1cc7a850e76 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: teyyytetyy
Output:
| [
"yytetyy"
] | task850-22e50a9a66494fb8b39c1b9e6f4ce09b |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: igaiagaaigg
Output:
| [
"gaiag"
] | task850-afbfdabc809e4b2495bb43f3828710cb |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: cfcyffyffcfcc
Output:
| [
"ffyff"
] | task850-30875f890fd9445e83f2c47cef86c770 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: iiwwbwbbiwiw
Output:
| [
"wbw"
] | task850-2beec63397f2469280ace614a1d6aaed |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: qrryyqyyyrqrqq
Output:
| [
"yyqyy"
] | task850-64b8bb7526384a67bd6f26f7acbb2ceb |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: wwtwwtpwwt
Output:
| [
"wwtww"
] | task850-663af5431b6e42118521412f514bc44c |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zjzojzzjjjjzo
Output:
| [
"zjjjjz"
] | task850-5a85ccec5fd0432fa48c9df370eb3cd7 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: tfqtqftfttttf
Output:
| [
"tfqtqft"
] | task850-ec78364a266d4477a55754f6cbb8d5b5 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: vuzzzvuzvzuv
Output:
| [
"vuzvzuv"
] | task850-65d8816d565a4c1b92115518d48f2e0e |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ncccbnccnbbnbbb
Output:
| [
"bnccnb"
] | task850-0072f33d8d714322a3a7574810354a1e |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: iiikrriikrrki
Output:
| [
"ikrrki"
] | task850-503f06a2705b42b4a1aefb83b4e3d473 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ccszsccsczzzzcz
Output:
| [
"ccszscc"
] | task850-8caddac316d94cbebe477ca4de3acb47 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: dlhlhdldddhlddh
Output:
| [
"lhl"
] | task850-ae220f99cb3c449f97c5290fc96189da |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: vsvsfvvvvfsvvfs
Output:
| [
"vsfvvvvfsv"
] | task850-a447fb3583d64fcd9d4ab468b89ea95e |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: goyygyooggyo
Output:
| [
"ygy"
] | task850-cf27cfac66504a3fa5b6f66e9cc61d63 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: etjtttjjjetet
Output:
| [
"jtttj"
] | task850-5890dd4ff5124fa5b20e2891ac3e0f57 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: dllcddccdclclc
Output:
| [
"clclc"
] | task850-8a3337e704e640d4903ddf6d4449df17 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ffffffqtftftqf
Output:
| [
"fqtftftqf"
] | task850-79a925bb89b249d7b8899c3672d5e45a |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: aadaaaddav
Output:
| [
"aadaa"
] | task850-ca8e245b304f428e866d077f8d43132a |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: sqqtssqsstqs
Output:
| [
"qtssqsstq"
] | task850-0b691315dd834b8d8b5a014b6ba62adc |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ppidipiddpp
Output:
| [
"pidip"
] | task850-3a3da4c3da0e40f3ab23b17b94ed6745 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: pzmpmppzzzz
Output:
| [
"zzzz"
] | task850-08d55509e46043c4b7f04092cdebc9ff |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: uluuulvluvluuvl
Output:
| [
"luuul"
] | task850-4582c14f71034c3fafe47a2773551ced |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: kjyjyjjyjyjkj
Output:
| [
"kjyjyjjyjyjk"
] | task850-5abab3fafadf4a5db3c31f3791e553ed |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ebezebebezbbbeb
Output:
| [
"ebezebe"
] | task850-d7653bc8c1bb437eb76f152c01687b15 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: galagllgaglal
Output:
| [
"agllga"
] | task850-a50cae934d284234bca99a2cd042113f |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: aazzaaaaazzazaz
Output:
| [
"azzaaaaazza"
] | task850-eebbf9ec597849fbb0dbb3bbce06384e |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: rirrriiffiriiir
Output:
| [
"irrri"
] | task850-927fa849edd6426e93ac92f151a67008 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: jtjjjtjjjjjj
Output:
| [
"jtjjjtj"
] | task850-f6b6d649c0bc42de895e6f51bd9e3e97 |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ssdysyssyd
Output:
| [
"yssy"
] | task850-facc712b7f294c1e91aa272ffb82e56f |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zsosozzzzoo
Output:
| [
"ozzzzo"
] | task850-8a9e578e1ff5456b95de0522f294c8ec |
Definition: 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.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: yycyaaacaccacy
Output:
| [
"caccac"
] | task850-c3befdd657684ccb9a1232fa618f46a8 |
Subsets and Splits