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: bsoboosobosbbb
Output:
| [
"sobos"
] | task850-d5321920134d4e1f9c2126cf56ff305c |
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: xrraarxrraraaa
Output:
| [
"raar"
] | task850-5a5b8c4d369342bcb78b69db9ec4667e |
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: iiyiffyyiyfyi
Output:
| [
"iyfyi"
] | task850-aaa01ff1dffa47f5be22633fc8faa2db |
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: vvkvzvzkkvkkv
Output:
| [
"kkvkk"
] | task850-606370a193f641a5ae19b920a9c3353e |
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: iskkskskik
Output:
| [
"ksksk"
] | task850-2cd77ebb9ac14b2c91f7a2b5efc58270 |
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: nlfnnnnnlnf
Output:
| [
"nnnnn"
] | task850-26c87f7803ef423b9030679eaee2ad45 |
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: ttdtdtdtddtdtdd
Output:
| [
"dtdtddtdtd"
] | task850-d65f7b5215d8422ea29243aaaab020ba |
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: osskkkksskss
Output:
| [
"sskkkkss"
] | task850-d8f205212ccf41ac84c44e5e8a82bae7 |
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: ecccecczecee
Output:
| [
"eccce"
] | task850-f5ee45660b2546a1b15762da1ce24f53 |
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: uvvvuqvqvuvvuvq
Output:
| [
"qvuvvuvq"
] | task850-74a8afef0c374b5495da46683b678d07 |
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: kukckukcuc
Output:
| [
"kukckuk"
] | task850-60f4bd1fa9b8477b9fa0423aa0dcc749 |
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: bbjppbjbjpbjb
Output:
| [
"bjb"
] | task850-d671006f6dfd4c39a66242995a3b9291 |
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: mxmmmmamxaxxxm
Output:
| [
"mmmm"
] | task850-e4cd976c6cd7489cb0bae07baa10f5af |
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: ioodioidio
Output:
| [
"dioid"
] | task850-10310ece8d994dcea50db30b701e5e0f |
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: wwwzwzwwwww
Output:
| [
"wwwzwzwww"
] | task850-5c60188ea6ab4645894b89afa6db9689 |
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: ssgsrsssss
Output:
| [
"sssss"
] | task850-ce62c195e1f04588ae5490510ddf9673 |
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: yxuyyyxyyx
Output:
| [
"yyxyy"
] | task850-ddcaf7de7fd041bf92b613b2e11f28d5 |
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: oopojopopp
Output:
| [
"opojopo"
] | task850-e3677f90e88d43e8b1ffd9109d1dd014 |
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: jofffjofjfjjo
Output:
| [
"fff"
] | task850-0770565ec2a246baab72da4fd6387021 |
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: yiiwiiyywwwiy
Output:
| [
"yiiwiiy"
] | task850-1d134a6303c649f89427d1e9f7b2eae7 |
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: zzhzzzzuhhuhh
Output:
| [
"zzhzz"
] | task850-aca6565e458844098a74f6d8e8ff942c |
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: ttoottooot
Output:
| [
"ttoott"
] | task850-feb9f2d01f324b338f6147b5f8587a2f |
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: eeujuuuuujjje
Output:
| [
"juuuuuj"
] | task850-2b560ca9da1847ef99c4225ae26cda61 |
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: hqhqhhqrqqhrrqq
Output:
| [
"hqhqh"
] | task850-716da6abc6ad4d789e9a66cc800be289 |
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: wgygwywyygg
Output:
| [
"wgygw"
] | task850-6b5d0f2f940a455e83a4c12f9b5303e1 |
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: yyynyynyyy
Output:
| [
"yyynyynyyy"
] | task850-065800411358448c9f0aa78ff6a06a69 |
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: cyyxyyxxxx
Output:
| [
"yyxyy"
] | task850-ee689683b6a1459a8e4ce4416b283242 |
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: kassaksaskssksk
Output:
| [
"kassak"
] | task850-4c16b29b5e2249daa5892da23c80d53c |
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: uiuuuieeiu
Output:
| [
"uieeiu"
] | task850-25a3817297d44b9088b231cbde12ccbd |
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: eezzszsszes
Output:
| [
"zssz"
] | task850-d024775b45574fefb8b7ed19a07c723b |
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: svsgvsvvss
Output:
| [
"svvs"
] | task850-675e6397414942b0a43d496cdf185038 |
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: djjwdjdddjddwj
Output:
| [
"djdddjd"
] | task850-f34cf16b0efc47148badb47e4ed570c9 |
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: vffvvvvffv
Output:
| [
"vffvvvvffv"
] | task850-958b6d27b93c40e2b08f6b4904a1b92a |
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: njjnjnjjjn
Output:
| [
"jjnjnjj"
] | task850-67cf8163a9e1431095fc7094457c48ba |
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: ooeoeneeeeo
Output:
| [
"eeee"
] | task850-671494bfe620439ab1db6290bc799033 |
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: cssccsjcsscsccj
Output:
| [
"cssc"
] | task850-a7ef44ec2d08482aa22559355eb0ba79 |
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: zzzgzzgzzggzgg
Output:
| [
"zzgzzgzz"
] | task850-af265af326534ee582a4146097316fb9 |
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: ueeuueeuekueeuk
Output:
| [
"ueeuueeu"
] | task850-0c5bdb22f29640ff957c92d6320cc3c8 |
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: kssssstkkskktsk
Output:
| [
"stkkskkts"
] | task850-bc58ef0000ac4694a53cb02a12144435 |
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: ggxdgxgdddxxg
Output:
| [
"dgxgd"
] | task850-76d5a3795c3b4194a569f1de2dee6636 |
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: xsjjsjsxjjxsxjj
Output:
| [
"jjxsxjj"
] | task850-c47fb19d4aad46928fa3ad97f9143190 |
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: ziziivziiz
Output:
| [
"ziiz"
] | task850-75eebbf5b0c44cd6a4ca56b2ce9fb83e |
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: nrrrrrnrrrrr
Output:
| [
"rrrrrnrrrrr"
] | task850-6f00be170d644f3fb7047969e0a145b7 |
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: fzzwzwwwzzwzf
Output:
| [
"zwwwz"
] | task850-bed961da8b354f839d0403b942a0c58b |
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: eeettttetet
Output:
| [
"etttte"
] | task850-4bdc1d419dbb46e097064733302c828b |
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: qfqvvqqfqvff
Output:
| [
"qvvq"
] | task850-a8713d2ae27e4939bad41131f98e721e |
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: zxzzffzzfx
Output:
| [
"zzffzz"
] | task850-0b8f6420ddd043fbb43fb8d6997272a7 |
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: wmmmwmmwmlwmmm
Output:
| [
"mwmmwm"
] | task850-ec0e088ce73d4017ab853db48096c739 |
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: dokdokdddookkkd
Output:
| [
"ddd"
] | task850-c4b2d476d3564a0ab051ea8c53a76d06 |
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: ksskssssskkkssk
Output:
| [
"ksssssk"
] | task850-e77220ff46654693809391dd68a8813d |
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: llllwllwwwllwl
Output:
| [
"lwllwwwllwl"
] | task850-7060029d38a14033bc9a7f197eb269d1 |
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: hlhhhhhhhhlhh
Output:
| [
"hlhhhhhhhhlh"
] | task850-fc24e51be73b4e3cb3c9649eda2f938e |
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: otoojjtoojt
Output:
| [
"oto"
] | task850-b28c05b3e0164b0c8bf61fa3e9461dac |
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: iviwwvwwivivww
Output:
| [
"iviwwvwwivi"
] | task850-bd86bcdadfb0424cb6084326994506d9 |
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: ttsasaaasss
Output:
| [
"saaas"
] | task850-e79158d655c14a8f9c2e2236d3e8bde5 |
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: laallaaalabbal
Output:
| [
"aallaa"
] | task850-cf20c3d9f3e44f2d8689e0ef63b733b6 |
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: ieiwiwwwweewe
Output:
| [
"wwww"
] | task850-9a0939caa57a4b1da9d513174e8dd875 |
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: slssxsllsll
Output:
| [
"llsll"
] | task850-44064393cc9c4fbf9ae25443244cf7ff |
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: llljllllcccl
Output:
| [
"llljlll"
] | task850-2760ee8016ef4b8280ddd2d0e7826041 |
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: rrgxgrggrx
Output:
| [
"rgxgr"
] | task850-0fd5a3daa0e7468ab40ff1aec6519d81 |
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: evvveeiiieeei
Output:
| [
"eeiiiee"
] | task850-6615862519be44e6a9a7f7a23fa30d54 |
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: qhhmhhqmqmhmhq
Output:
| [
"qhhmhhq"
] | task850-988221196b394824b1b8e970be72d38b |
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: fekfekeffffke
Output:
| [
"fekef"
] | task850-8631767917b948d0a615a0ee14d09d54 |
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: awwswawwssaaa
Output:
| [
"wsw"
] | task850-6019f5209fe64eba8d735c19ffaa3110 |
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: pzpvzzzzpvvzzz
Output:
| [
"zzzz"
] | task850-7d21bdc85e5741df865d27a761c04d6a |
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: qaqqqaqmaqaqama
Output:
| [
"qaqqqaq"
] | task850-eee593dcf73f4ebd9cf121a859d30fdd |
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: dfdfdffdfk
Output:
| [
"fdffdf"
] | task850-894cb362748c46c3b11ac87c8a9703c8 |
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: rrdddrrdnnrd
Output:
| [
"rrdddrr"
] | task850-315e313fdb9744608f534431b4a9921a |
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: gvvvgvyvyy
Output:
| [
"gvvvg"
] | task850-243b4b87f5ba4b3199d9d575c389a56d |
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: acfacfafcf
Output:
| [
"cfafc"
] | task850-94a5db43fcd2470a92878811b6b46c26 |
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: xnnxxxxnxx
Output:
| [
"nxxxxn"
] | task850-510e7791fa4b4a4e9df60da261aad066 |
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: cbjccbccccj
Output:
| [
"ccbcc"
] | task850-84e8df555f3c4f82890f7e6560a68499 |
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: jzjjjqqqzj
Output:
| [
"jzj"
] | task850-810392c4d54448fd8f3167f8eaa378f3 |
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: vcclclvvcllvvv
Output:
| [
"clc"
] | task850-aaf1be5aefe049209ba1eebc9945529b |
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: vvsssssvvvsvvs
Output:
| [
"vvsssssvv"
] | task850-57dc358b8a34404b801b10d3f53683ef |
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: naawnwwnwa
Output:
| [
"awnwwnwa"
] | task850-0c1dbf971261422f800f77b45b726069 |
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: rrrjsjsjrrjrjsr
Output:
| [
"rrjsjsjrr"
] | task850-ac63ca2a96ad46e9acdc6e124279f9f9 |
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: annnaxxaaa
Output:
| [
"annna"
] | task850-a44a96713b114f818ad3a586616882d8 |
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: msgmmgmsmsgmm
Output:
| [
"gmmg"
] | task850-d5b4bbb5af504ed4a42014cab8eb48a1 |
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: tviitiitvttvi
Output:
| [
"iitii"
] | task850-e85151aa2ad744c59a221c5a47ef0c99 |
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: otopottptott
Output:
| [
"topot"
] | task850-9a6b276a9d7e4b0bbd7500ef426d96a5 |
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: yaaaaavyavyaay
Output:
| [
"aaaaa"
] | task850-386672ad6ce4471f8a753cbcc2a83c1e |
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: zpupzpupzzu
Output:
| [
"zpupzpupz"
] | task850-61250959f42a4d3e8b2e989c5d6ddfd9 |
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: rruoooourru
Output:
| [
"rruoooourr"
] | task850-dabc47f433924f4bbf687e9c9ef6b19f |
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: jvvvjvvvtvvj
Output:
| [
"vvvjvvv"
] | task850-89b85faf36484dd0973583baf334dc94 |
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: ddddndnddd
Output:
| [
"dddndnddd"
] | task850-79b33e7a997a426b8951fd75ff8b6fd9 |
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: uvsusuvsvv
Output:
| [
"sus"
] | task850-416c1484eadf421ebc2adcf7601e63f3 |
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: ofwwwffofofw
Output:
| [
"fwwwf"
] | task850-b1cb38ea23664ebba0d2190ff3647b5f |
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: cttxtcxtxtctt
Output:
| [
"txt"
] | task850-40913eb7f9bb4cd691cbf6928df53736 |
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: llnlqqqlql
Output:
| [
"lqqql"
] | task850-8e87e491546b412f9f455aef554f9468 |
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: vwwvwvvwwvvv
Output:
| [
"vvwwvv"
] | task850-05c3d8188ba24b76942c5f51497df550 |
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: yyiikiiikiyy
Output:
| [
"ikiiiki"
] | task850-5068ed38dded414c86236b6dc20d773a |
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: ununaaanunuuunn
Output:
| [
"ununaaanunu"
] | task850-e23aa5188b6c41a28414be35f70004d3 |
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: bflflflblflf
Output:
| [
"flflblflf"
] | task850-8fa51cdde24441c49508994a54e7148e |
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: nwwwwwcnncccw
Output:
| [
"wwwww"
] | task850-21a77baa673045b2a2f474d3e455c08f |
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: ovoqvvvovvovqvv
Output:
| [
"vovvov"
] | task850-3723682034a4474e825a1c005bd3ef98 |
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: ccsssssmmm
Output:
| [
"sssss"
] | task850-02d40cfbc83d409589b323b880202ef8 |
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: oooooodoodod
Output:
| [
"oooooo"
] | task850-4767cde68c044fc1b2ecde7df940caf4 |
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: zoozzoxxooxx
Output:
| [
"xxooxx"
] | task850-4a036849fe8e4ef1bf7ff3d588a984bb |
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: iyiiiiyybyiiyi
Output:
| [
"yiiiiy"
] | task850-65fd352e85f4492cb82e5d1d47655df6 |