Dataset Viewer
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: vvvllttltl
Output:
| [
"lttl"
] | task850-cce90bc9b4454ced94104a5f5c8ae31a |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: yylylyyyyll
Output:
| [
"yylylyy"
] | task850-158e5099ae154ebd924dfa1faa89da88 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zzzzzzzzzozoz
Output:
| [
"zzzzzzzzz"
] | task850-275c3d49f5ec4b3fbce457f7fe69a374 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: lllllllccllccll
Output:
| [
"llccllccll"
] | task850-9a75b024e9f04418b5c8d16772fc860f |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zxxxxzlxzl
Output:
| [
"zxxxxz"
] | task850-0277292374714adc802b31a5835a119e |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ueuuttutueuuete
Output:
| [
"uttu"
] | task850-2505b96e10a247c0907b716276129e05 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: eveefveveffvfvf
Output:
| [
"fvfvf"
] | task850-2b09a51e72004feeb16a3877ba3be705 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: icciicuicici
Output:
| [
"icici"
] | task850-111bf513b13740febc8f05acd8b78f48 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: mmiiiwmmimww
Output:
| [
"iii"
] | task850-b0b4c381b5bb49fdbdc7fd8fb7855791 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: sqqsssisqsiis
Output:
| [
"isqsi"
] | task850-9200081622404b248e19446b46849cda |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: eelelaellaleall
Output:
| [
"ele"
] | task850-615ff344707e422186650d2217638c77 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: tlltltlttll
Output:
| [
"ltltl"
] | task850-954e7cd9411d484eabdc2450a7c105fe |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: hvhvhhvvvvh
Output:
| [
"hvvvvh"
] | task850-89b5cb06134a4faea69690f3e09ca237 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: hghghgghhg
Output:
| [
"hghgh"
] | task850-e2c285ac749a4955897213301ff48d4c |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: aaawaeewwwaawa
Output:
| [
"waaw"
] | task850-2abc5a8e11274134b752d9a4c2caad35 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: kekeerrrrrkrrke
Output:
| [
"rrrrr"
] | task850-20325b4efcc543c8a69974c9103e7759 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: xqoqxoqxoqoq
Output:
| [
"xqoqx"
] | task850-5ab9d31542a14a98870ceec4c97bba2e |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: dddddqddqdd
Output:
| [
"ddqddqdd"
] | task850-4436687e3445461fa0ad2d5955571ac1 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: sswwsswssss
Output:
| [
"sswwss"
] | task850-96aeaca6cddf4e05bbc75ef26b1973bd |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: eedaedeadad
Output:
| [
"daedead"
] | task850-8bcaf56b92f2408ba7fe4f13d5c2510e |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: iqpqipippqiiiq
Output:
| [
"iqpqi"
] | task850-dfa4943e15bd4c23b822f32de0883647 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ssseseeeeossoeo
Output:
| [
"eossoe"
] | task850-3c34a6f03ead4ca68eec53b36f4ff0b9 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: pppprrffff
Output:
| [
"pppp"
] | task850-92314f91a4144d1d9ad81203b7cd12e8 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: qqeefqqeqffefq
Output:
| [
"qeq"
] | task850-67231b1023824a2d99e9a6c552300de8 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: cytttyttytyct
Output:
| [
"tyttyt"
] | task850-7be49b5bf3e44500826a55af244d6170 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: zggcczgzgczccc
Output:
| [
"zgz"
] | task850-6205c3b982c34d77aa7ddd4b7268fc3d |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: vbbvbbqbbqvbqq
Output:
| [
"bbvbb"
] | task850-018db62f7c94417eb8c6f2f770ecadd4 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: shsoosooooh
Output:
| [
"oosoo"
] | task850-06e4320b1aee4255904adfdeb34679f9 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: vzzzzzzzzv
Output:
| [
"vzzzzzzzzv"
] | task850-4ded4cf5777b4d59b5e290196b613aba |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: tttuthuuuhhhth
Output:
| [
"huuuh"
] | task850-0ec9200aefeb4516916c0e51c596ce96 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: bdeeeddbbbbe
Output:
| [
"deeed"
] | task850-7a44fd73190a446cb2b0b68f2cd4bd73 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: igiwgwwgiwww
Output:
| [
"gwwg"
] | task850-d55cb40cde6a4473be87953def643ebd |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: gglglcgcggcgcl
Output:
| [
"lcgcggcgcl"
] | task850-d5b53df049c946de94dbad29aecc4ccb |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: hjhiijjjjh
Output:
| [
"jjjj"
] | task850-4ce959c7c4d64b1dbf5db167fab7b37f |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: rlrlrwlwwlr
Output:
| [
"rlrlr"
] | task850-7acef8af9f194e62b50b07003d0c4043 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: hhkkpphkhhhh
Output:
| [
"hhhh"
] | task850-46ce94e4b4bf40508d6854cbd22b7889 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: qtrrrtqqtrrqq
Output:
| [
"rrtqqtrr"
] | task850-2d65daad4c154f14a5b6e8660c63f2ee |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: byyyybbbnnynnbb
Output:
| [
"bbnnynnbb"
] | task850-ebf0908e158b47e2aebebcb10fa4b036 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: lfllfxxxflll
Output:
| [
"llfxxxfll"
] | task850-2ae8163517694584a19b7b26d3d77d3c |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: xxfffoooxxxoo
Output:
| [
"ooxxxoo"
] | task850-52413d12aa6d40a598d980b3cff281ce |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: iiiivvkviikvki
Output:
| [
"ikvki"
] | task850-d26b529e43c14aaab7335b1e5feb4f4d |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: gqaagaggqgaqaa
Output:
| [
"aga"
] | task850-88a75649a2ef45c7b7317291b3adcbca |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: gthhhggtthtght
Output:
| [
"hhh"
] | task850-5618d953a1d243a29cbb445883a58762 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: nhhnnhnnhbb
Output:
| [
"hnnhnnh"
] | task850-d9900832a6b84ae3bf0bd4d0e807bc92 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: nnnjqjnnnjnqqj
Output:
| [
"nnnjqjnnn"
] | task850-c95723ddc32646379b61a1924ed05ac4 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: qpnqnqqqqnq
Output:
| [
"qnqqqqnq"
] | task850-976e6c53920540d786ca3191565e8e17 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: tdddtdtteeede
Output:
| [
"tdddt"
] | task850-c35f09f07e6d4054919a6a3245cd1f5d |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: xtotoxooxtxooo
Output:
| [
"ooxtxoo"
] | task850-b864c4fcd4a64b78ac88658424abf12b |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ytmyyymmmmymmmt
Output:
| [
"mmmymmm"
] | task850-edf610a8654b44d3aaf196770fac4930 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: eexfxfexxxfxf
Output:
| [
"xfx"
] | task850-653f63a2286a43b1b3f291ddc3b18c43 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ayymymmyyaymmy
Output:
| [
"ymmy"
] | task850-717589bf71104b648471877d643631f1 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: llvvkvllkvkv
Output:
| [
"vkv"
] | task850-cac6a5b4a371466093a44ad4c58b0bff |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: aavavasavasvvss
Output:
| [
"avasava"
] | task850-7cd1824036d84092ba4777e8dda8fc70 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ggtrtgrrtrgr
Output:
| [
"gtrtg"
] | task850-d12ad68ae8ec40db9c9d6cd3b489a830 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: mtmtssstsmmss
Output:
| [
"tssst"
] | task850-cc0f11cffa354d63a1e9b4fc96fd986b |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: pplpllppllppl
Output:
| [
"pllppllp"
] | task850-74a10c99612648a2bedb8f8dd167f486 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: jtsjsjjssttjss
Output:
| [
"sjjs"
] | task850-2b4b8ef0b5df4979b97ac72c033da5e8 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ypypwwwypwypp
Output:
| [
"ypy"
] | task850-8bd10c3fa3654cd5adb6c902bf584cfb |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: esrrsrrsesrre
Output:
| [
"esrrsrrse"
] | task850-2c4d7834ae524b65a682fea53fbb423b |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: bwjbbbbbbwbb
Output:
| [
"bbbbbb"
] | task850-df5c625e2f9149d087d9bd3978ffec3b |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: uuurrrrruurruu
Output:
| [
"uurrrrruu"
] | task850-c26741f4d16d4ee2ae914b4e597a8372 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: qlloqqlooolll
Output:
| [
"loool"
] | task850-8138611b8b06434896f297e26395da9e |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ojojoujouojoj
Output:
| [
"ojojo"
] | task850-54d64dedd07c4ba3ab445c381ba201e9 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: dctdtdddctccdcd
Output:
| [
"tdt"
] | task850-ec082c50d1e1455eac5abfbc3b5f2a4f |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: qppxppxppqxxp
Output:
| [
"qppxppxppq"
] | task850-f962813e0461430382c5bef9e97f27fb |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: hahabbbbhhhaab
Output:
| [
"bbbb"
] | task850-96b8e32f5e75423b9014629b05a53675 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: hhzzzbhzzzbb
Output:
| [
"zzz"
] | task850-c17c409934104044b507114aa281fd0e |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: xjxxxjxjxxjx
Output:
| [
"xjxxxjx"
] | task850-c8f5408d2a4f4954ba0bdc5f1b9a06a3 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: gwwwwgwgwww
Output:
| [
"wwwgwgwww"
] | task850-dd472b04060545ce8a54d1f3d9760151 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: jjjajajjjjajjj
Output:
| [
"jjjajajjj"
] | task850-5aff97270e3c46fbbba6ed8c4baca0c5 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: yyshyyhysyysyhy
Output:
| [
"yhysyysyhy"
] | task850-9a08eebc5796485aa747a6f4f57513a6 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: qqqdddkqqqqdkd
Output:
| [
"qqqq"
] | task850-d9363cf453444ecab21d529ce3f64755 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: kkrrkrkkkrkrkr
Output:
| [
"rkrkkkrkr"
] | task850-4cd6be8c10a34a28a667b990a6a2695c |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: cccccdddcccdccc
Output:
| [
"cccdddccc"
] | task850-6316cde351bb477d98525c7ce16bb9fe |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: oqcoqcoqoocqo
Output:
| [
"oqo"
] | task850-fd6e97b6e2094f1598f715a4a160cced |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: aakkayykyykky
Output:
| [
"yykyy"
] | task850-1c081ee70c3f421a8fc0b57587561d38 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: nzziznzznninnzn
Output:
| [
"znninnz"
] | task850-24eacf4cd84140cda5a2ab2f833a5bcf |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: dnnddffdndfd
Output:
| [
"fdndf"
] | task850-b618e6c1fd974be8b64affe71b9e82d2 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: onhhhnnooonnooh
Output:
| [
"nnooonn"
] | task850-962d713e2a7f48b581b531dae15b38a1 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: qqfllllfffqfqq
Output:
| [
"fllllf"
] | task850-001ab59c4a7d45659b623afd6e046f40 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: uccffcuuuufcucc
Output:
| [
"cffc"
] | task850-12ccec48e50146c6a30ad1db2d7d45bd |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: rnrenerrrrrrerr
Output:
| [
"errrrrre"
] | task850-86fe78bc242a4269a7ad9e72abe8e329 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: cquuuucqqquuqc
Output:
| [
"uuuu"
] | task850-517bb3287ecb43c7af7d3f967e2fea91 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: wzywzwzzyzzy
Output:
| [
"zzyzz"
] | task850-cdcde16e2b7d4ac58bf923876d259270 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: pppxxccppxcp
Output:
| [
"ppp"
] | task850-29040cc5d32e475ca7f966fc25f33bcf |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: wowzzzozozw
Output:
| [
"zozoz"
] | task850-a33c8343ae154ac29419d3be9a66c372 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: txtaaaatxtaxa
Output:
| [
"txtaaaatxt"
] | task850-844fa159dbe745a18353378057c8fe89 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: fjnjfjnfjjjnj
Output:
| [
"fjnjf"
] | task850-539edee433554bfc9831d2a46cf37bd1 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: nknknkdkdd
Output:
| [
"nknkn"
] | task850-601bf6a6f6bd47ce860e0c4d07f22eaa |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: vmmtvvttmvmvttv
Output:
| [
"tvvt"
] | task850-3bd308d647a54e918b49eb291b3bde6a |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: kkskkckcckkc
Output:
| [
"kkskk"
] | task850-541fc7aab7f64a5fa6af6f74ecd4e85c |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: rukrkkrukkr
Output:
| [
"rkkr"
] | task850-a4d0aadcd5354402a2642f4585bbf7b4 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ieieeleiei
Output:
| [
"iei"
] | task850-beeecfca42444eb189dc36a1ef9f4598 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: pddqdqpqdqqp
Output:
| [
"qdqpqdq"
] | task850-30a6eb77d3004c6d9756964bb9371a04 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ololslsosooll
Output:
| [
"olo"
] | task850-18c48ad90a664d8fa3acb08566612536 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: slusssllluls
Output:
| [
"sss"
] | task850-88e09a8159964e49aacb539d820f63b2 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: bggwwwgbgg
Output:
| [
"gwwwg"
] | task850-e7f3607f0cb347c9912ee3e33a989aad |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: tyvttyvttyvvvt
Output:
| [
"vvv"
] | task850-73083b8decff47fbacbd00f8f7f8502b |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: ikixxikkxxiikik
Output:
| [
"kixxik"
] | task850-7a79e50819df4f6e91df1375cba38623 |
Definition: In this task you will be given a string and you should find the longest substring that is a palindrome. A palindrome is a string that is the same backwards as it is forwards. If the shortest possible palindrome is length 1 you should return the first character.
Positive Example 1 -
Input: gocogccocco
Output: gocog
Positive Example 2 -
Input: fedfe
Output: f
Negative Example 1 -
Input: xxpppppxgxgp
Output: malayalam
Negative Example 2 -
Input: wxwwxmmxwwm
Output: 8
Now complete the following example -
Input: gogogooeeeoegee
Output:
| [
"gogog"
] | task850-aa16c188ec6b44eca33316b8053b049e |
End of preview. Expand
in Data Studio
Dataset Card for Natural Instructions (https://github.com/allenai/natural-instructions) Task: task850_synthetic_longest_palindrome
Additional Information
Citation Information
The following paper introduces the corpus in detail. If you use the corpus in published work, please cite it:
@misc{wang2022supernaturalinstructionsgeneralizationdeclarativeinstructions,
title={Super-NaturalInstructions: Generalization via Declarative Instructions on 1600+ NLP Tasks},
author={Yizhong Wang and Swaroop Mishra and Pegah Alipoormolabashi and Yeganeh Kordi and Amirreza Mirzaei and Anjana Arunkumar and Arjun Ashok and Arut Selvan Dhanasekaran and Atharva Naik and David Stap and Eshaan Pathak and Giannis Karamanolakis and Haizhi Gary Lai and Ishan Purohit and Ishani Mondal and Jacob Anderson and Kirby Kuznia and Krima Doshi and Maitreya Patel and Kuntal Kumar Pal and Mehrad Moradshahi and Mihir Parmar and Mirali Purohit and Neeraj Varshney and Phani Rohitha Kaza and Pulkit Verma and Ravsehaj Singh Puri and Rushang Karia and Shailaja Keyur Sampat and Savan Doshi and Siddhartha Mishra and Sujan Reddy and Sumanta Patro and Tanay Dixit and Xudong Shen and Chitta Baral and Yejin Choi and Noah A. Smith and Hannaneh Hajishirzi and Daniel Khashabi},
year={2022},
eprint={2204.07705},
archivePrefix={arXiv},
primaryClass={cs.CL},
url={https://arxiv.org/abs/2204.07705},
}
More details can also be found in the following paper:
@misc{brüelgabrielsson2024compressserveservingthousands,
title={Compress then Serve: Serving Thousands of LoRA Adapters with Little Overhead},
author={Rickard Brüel-Gabrielsson and Jiacheng Zhu and Onkar Bhardwaj and Leshem Choshen and Kristjan Greenewald and Mikhail Yurochkin and Justin Solomon},
year={2024},
eprint={2407.00066},
archivePrefix={arXiv},
primaryClass={cs.DC},
url={https://arxiv.org/abs/2407.00066},
}
Contact Information
For any comments or questions, please email Rickard Brüel Gabrielsson
- Downloads last month
- 40