input
stringlengths 551
556
| output
listlengths 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: nuuuwnnnwwwnwun
Output:
|
[
"wnnnw"
] |
task850-55fe6885beab4157ae723c4b337dee88
|
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: xkkkkkuukkuxkkk
Output:
|
[
"kkuukk"
] |
task850-8db8bffa87a3471b85d3ef2a9881b2f8
|
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: vvddtdvtdtvdvd
Output:
|
[
"dvtdtvd"
] |
task850-c864d3b3ac864e7c874c6ad84eec83d6
|
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: jeejnejjee
Output:
|
[
"jeej"
] |
task850-94ef41e46fde46cda2a449d252da8cdc
|
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: kkkkykkakyk
Output:
|
[
"kkykk"
] |
task850-e284404d9aa34bcb9dc0d88649ab28cc
|
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: uwwquwwuuqqq
Output:
|
[
"uwwu"
] |
task850-c6101cd3249341e4a268546188cc6162
|
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: mmwmwwmmrmwrwwr
Output:
|
[
"mwwm"
] |
task850-3223a834612e405fb1cfbcc2c7d57da7
|
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: vcccrrvccv
Output:
|
[
"vccv"
] |
task850-ae080682ceeb426ca82ecc5c5ecc50ef
|
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: ttqqqqqttq
Output:
|
[
"ttqqqqqtt"
] |
task850-f4827e93f14c40018138ff3ee43a8aa1
|
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: ussssuaussusua
Output:
|
[
"ssuauss"
] |
task850-bf6241dfdb6d4753b4c9d450f2ac2ec9
|
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: dezddezezzd
Output:
|
[
"eze"
] |
task850-66f107671c364911af51835394c841f5
|
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: lmdllldmdmllm
Output:
|
[
"mdllldm"
] |
task850-dc01a99b642545089bc6c9aa8d69b11f
|
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: ccggddcdccc
Output:
|
[
"dcd"
] |
task850-838902ddc02642d29a85177d55eebcb6
|
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: zzhhnhnzzznnz
Output:
|
[
"nzzzn"
] |
task850-afd3bd51b46f4cd3be583a11cb8bcfbc
|
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: qfkqkfkkkkfk
Output:
|
[
"kfkkkkfk"
] |
task850-6934b8cac0b44040a6732716001633f4
|
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: qrrlqqlrqrrrq
Output:
|
[
"rlqqlr"
] |
task850-c8d98b6809bf4135aeaf0db71f3a61ca
|
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: ejvvjjjvvvvevjj
Output:
|
[
"vvjjjvv"
] |
task850-24e70e05b7be4ed89ce14f53cc4eb2c6
|
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: rrmmmmtmtm
Output:
|
[
"mtmtm"
] |
task850-3daaa1dadf4649f4be01292c92a8793c
|
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: diiwiwiddwi
Output:
|
[
"iwiwi"
] |
task850-d2cd499cbdda4823b9ec99858b0b9926
|
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: yynkkynnknnkkk
Output:
|
[
"nnknn"
] |
task850-2e52374c5b2c4eebafd557654e4942e1
|
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: vvvllvvblbblblv
Output:
|
[
"vvllvv"
] |
task850-b559025de4e44881b31de54872b26835
|
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: pzzpszssppp
Output:
|
[
"pzzp"
] |
task850-fcbbdb75504b46f2a1fa03277c75b13c
|
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: ybyybyybfybffb
Output:
|
[
"byybyyb"
] |
task850-b3460dcdba054a9fa83b2cde231ce6e7
|
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: abwbbbbbaa
Output:
|
[
"bbbbb"
] |
task850-562484932b0045629a881b8233aec162
|
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: wiiiixixxxxxii
Output:
|
[
"ixxxxxi"
] |
task850-45a4e6557f0d49349ae88b467dacd8e1
|
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: cmcwcmwwwccccw
Output:
|
[
"wccccw"
] |
task850-f2dcde9a183543bf932d22cf77ea5898
|
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: ohorohrhrhhrhho
Output:
|
[
"hrhhrh"
] |
task850-60086a225ed84635a66b3609413d668b
|
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: xjxjjxjjjjj
Output:
|
[
"jxjjxj"
] |
task850-0c710201694e432191faf28417eb0614
|
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: yymyddmyyd
Output:
|
[
"ymy"
] |
task850-07b5c3135b8240fd9210586c890c0865
|
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: ggvgkkggvvgkgkg
Output:
|
[
"gkgkg"
] |
task850-5a6b2604e2ac493e9f23ebb9c1333132
|
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: ciicczcizczic
Output:
|
[
"cizczic"
] |
task850-971c3697b79f4b93838e5b3eb06d7f49
|
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: zyzzyzzzaazazaz
Output:
|
[
"zyzzyz"
] |
task850-41040557a9bc4cdd8c718483e26584c6
|
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: dgddgddogoogdgg
Output:
|
[
"dgddgd"
] |
task850-eee2415302fd4b30b19fdeb25b692209
|
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: lqddlldddldl
Output:
|
[
"ddlldd"
] |
task850-b6e32e3b0951475087c0103ddc625148
|
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: lzwllwwzlwww
Output:
|
[
"wllw"
] |
task850-79c7a242dc6b4ec7956b231bc5ca4446
|
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: wwewbbbebbbbww
Output:
|
[
"bbbebbb"
] |
task850-df94736e4f5246b591da0a69e83931a2
|
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: arraraarrraarrr
Output:
|
[
"raarrraar"
] |
task850-0c1d2e9d22944dceb552aa8c73101ffb
|
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: ssisiipipsipsp
Output:
|
[
"sis"
] |
task850-d501ccb95f4a40718035e8be96f62444
|
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: uafaaufuuuu
Output:
|
[
"uuuu"
] |
task850-c7ee966f823f451298165203e226f934
|
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: uutuputppup
Output:
|
[
"tuput"
] |
task850-8df0ffc7e19747de98de834edee73244
|
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: aaaaaaayaayaay
Output:
|
[
"aayaayaa"
] |
task850-862321fb5d7e47f882df15788b707c23
|
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: tmmmmtomtt
Output:
|
[
"tmmmmt"
] |
task850-5e69b575b0964905a98cf67d3a84877c
|
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: iiixxlxllxlil
Output:
|
[
"lxllxl"
] |
task850-1b126c169a42438b8f53e208b8bc4ec6
|
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: hhhyayahhyyh
Output:
|
[
"hyyh"
] |
task850-7d0b45f963234f9b9cefc3230cc5a2da
|
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: dffrdrrrrd
Output:
|
[
"drrrrd"
] |
task850-14325a23ce5a49cca0f8241dcc7aff7b
|
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: hvvvhhvvvvhvvv
Output:
|
[
"vvvhhvvv"
] |
task850-36039c3d1853405bb942c3369c435e4c
|
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: iiiiqqiihiqiiii
Output:
|
[
"iiqqii"
] |
task850-407b3a1b3bb041a392c3913b7308f7bd
|
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: fccfhfchfchhh
Output:
|
[
"cfhfc"
] |
task850-e9cf04e013cb46cb9a2b98a93bed98f0
|
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: jgfjggfggffj
Output:
|
[
"ggfgg"
] |
task850-98fdf61c2fc54085a7b854000f42781d
|
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: gtfgtgtgfgff
Output:
|
[
"fgtgtgf"
] |
task850-beb5cbf0287548a3acc09df2383fadce
|
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: yypxyyypyyyx
Output:
|
[
"xyyypyyyx"
] |
task850-b19e59c0d10c455385cae7e95cfd8202
|
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: dzzddyyyzyzzzzz
Output:
|
[
"zzzzz"
] |
task850-eead4c7b4b7248b79f8778174ee00214
|
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: jgsssjsgjsgs
Output:
|
[
"sss"
] |
task850-7e0217359a2045318fb625c69a393534
|
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: qxxxqqqxxxx
Output:
|
[
"xxxqqqxxx"
] |
task850-4d80e7ac9f324d1eb93227947d1257b6
|
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: ecooecocococe
Output:
|
[
"ecocococe"
] |
task850-6a7d510deec74625a897a651ab197ff8
|
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: sxxxxssxssxs
Output:
|
[
"xssxssx"
] |
task850-9e324c3503a74899a1454e0c7f8ebd78
|
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: qgghqhghgqqh
Output:
|
[
"ghqhg"
] |
task850-ca5c657b82e24564a9c515f6c84c7843
|
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: hyffyhffffhyhyh
Output:
|
[
"yhffffhy"
] |
task850-bdbca15768744383842142a22dfddb82
|
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: wiiiipiwip
Output:
|
[
"piwip"
] |
task850-bdca4a7416ba43e69ec91b56dd41eec7
|
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: eececeecececeec
Output:
|
[
"ceecececeec"
] |
task850-519feb6af68744199a47506ffcb0ca46
|
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: aininanaan
Output:
|
[
"naan"
] |
task850-ff78449c8ba645d291bb5b2d810a5739
|
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: tttlccltllcc
Output:
|
[
"tlcclt"
] |
task850-311c726e550f4030b60cd5650c29a86d
|
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: nyaanyanynyynyy
Output:
|
[
"ynyyny"
] |
task850-743a2c1f22c0423d8aaa5c7e900b9f33
|
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: grrpprggrpgppg
Output:
|
[
"prggrp"
] |
task850-5b61b7da864a4e2fb9176107c2978af4
|
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: cxcrccrrxrxrc
Output:
|
[
"rxrxr"
] |
task850-728db9ee7a6f4c088341a296841bb6a1
|
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: ncmcnncnmc
Output:
|
[
"ncmcn"
] |
task850-747334ba8fe048a491d7e2914d7caf1c
|
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: lvllllvlvl
Output:
|
[
"lvllllvl"
] |
task850-2c2740e2484f4384a76b1ff9d159c064
|
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: ucrcruccccurc
Output:
|
[
"cruccccurc"
] |
task850-388df6e31fd14cfd9781287482ed5fe5
|
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: scuucuucusucus
Output:
|
[
"cuucuuc"
] |
task850-b294acdf3a234c4da833e2df7dd15e2c
|
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: zxxzxnxnzzx
Output:
|
[
"zxxz"
] |
task850-60b486c2a1064305803441cbf29d931a
|
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: mtytmyymyymt
Output:
|
[
"tmyymyymt"
] |
task850-50d85fc64a344d07b08b5f282efd00e7
|
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: vyysysvyyvssys
Output:
|
[
"svyyvs"
] |
task850-195b389cbbcb44319327b8384eb37b24
|
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: dffxdddffffx
Output:
|
[
"ffff"
] |
task850-70a087ba85394fa1b6f76db11522b640
|
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: rquuuuuquqqqqr
Output:
|
[
"quuuuuq"
] |
task850-ce903f7ce95449eabc145a476ffb0701
|
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: neeekekkkke
Output:
|
[
"ekkkke"
] |
task850-c1042a161faa42ab9de08d632bf04bd7
|
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: ggjjggjkkjjkk
Output:
|
[
"ggjjgg"
] |
task850-7da8423842a4418fbdc3a9620e76ee6e
|
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: eerrebbeerbbb
Output:
|
[
"erre"
] |
task850-e4698ced32a0438788f44ad7dfdaa9aa
|
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: tgbbtgtgbttbtbb
Output:
|
[
"bttb"
] |
task850-cd97e9bfae424b98ac7c66eb42bfa876
|
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: kqjjjjqkqjqjk
Output:
|
[
"kqjjjjqk"
] |
task850-20f26b6562064e65997f305f55bc267d
|
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: rssvsvvvvrrrrr
Output:
|
[
"rrrrr"
] |
task850-f7a9ee62dbb44bc19ce91197d820cede
|
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: eerrererrreer
Output:
|
[
"rrererr"
] |
task850-29ea4b81f1af4398b18add5495327c30
|
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: lfxflxxlfxll
Output:
|
[
"xflxxlfx"
] |
task850-b8c1ef3bdacf4f08b1f58e9ecc564dba
|
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: ggngdnddgnng
Output:
|
[
"gnng"
] |
task850-c600078222c34200b52fe1511e6a2694
|
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: sssssdddsssds
Output:
|
[
"sssdddsss"
] |
task850-e22db778e7ee4d84a0f8992a370fb619
|
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: qddqkqqqdqkqqqk
Output:
|
[
"kqqqk"
] |
task850-849e5dd0a209430ca78c34a3a9eb80fd
|
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: ffrfrrfrre
Output:
|
[
"rfrrfr"
] |
task850-626f9f84e221483ab764d2d7efc33554
|
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: tnttnnnttc
Output:
|
[
"ttnnntt"
] |
task850-0fd6ab303a4f4067b0b5660bacfadf30
|
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: veevuuvuvve
Output:
|
[
"veev"
] |
task850-94e9aff94ad8436bace346bffe9a31d7
|
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: aslsllaallal
Output:
|
[
"llaall"
] |
task850-24681fd28683433183abf704450e8432
|
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: hhuuuouuuhhuoh
Output:
|
[
"hhuuuouuuhh"
] |
task850-5195578eca934fa4a75fab06ed89ad8c
|
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: cgcgccgggc
Output:
|
[
"cgcgc"
] |
task850-84b46b4d6faa4b4781a59bfff0958074
|
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: scmmmcsmss
Output:
|
[
"scmmmcs"
] |
task850-42c1d50c4c8f43148b00ad2f7f46d4c1
|
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: sjsssqjjqqqqsq
Output:
|
[
"qjjq"
] |
task850-71aec91ad76d44e29b8d9d7f63d8ef37
|
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: ebbbbebekkkb
Output:
|
[
"ebbbbe"
] |
task850-c00bc18f74d34187b5f787306e112395
|
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: lulllououuoloo
Output:
|
[
"ouuo"
] |
task850-5218a98f6f5349e9871daf295a908e0d
|
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: ggkgkkwwgkwk
Output:
|
[
"gkg"
] |
task850-b7162b964d164e4b89ec10edc1c94b44
|
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: fsshffhhhffs
Output:
|
[
"ffhhhff"
] |
task850-a13d122af46344eebfd2a2f713a2bf95
|
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: yylyysllyslss
Output:
|
[
"yylyy"
] |
task850-bc33d588cf114d59ac2d6abc5eee7e94
|
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: rrrpirppppp
Output:
|
[
"ppppp"
] |
task850-aaaf2b2bc4fa4e81b59b409d602c83eb
|
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: oppopppoooppp
Output:
|
[
"pppoooppp"
] |
task850-3788d002c3564550b39b14221809f544
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.