description
stringlengths
3
46
input
stringlengths
4
74
output
stringlengths
1
90
types
stringclasses
9 values
slice-k-n with k=2 and n=3
([4, 11, 16, 11, 10, 9, 5, 12, 6, 0, 5],)
[11, 16, 11]
list(int) -> list(int)
slice-k-n with k=1 and n=4
([3, 8, 9, 15, 11, 10, 0, 15, 16, 8, 15, 1],)
[3, 8, 9, 15]
list(int) -> list(int)
remove gt 1
([6, 3, 4, 1, 6],)
[1]
list(int) -> list(int)
parentheses around word delimited by ' ' & ' '
(' California +104,Teddy',)
(California) +104,Teddy
list(char) -> list(char)
Abbreviate separate words (I)
('+118', '894')
+.8.
list(char) -> list(char) -> list(char)
Append 'Dermody'
('Columbia',)
ColumbiaDermody
list(char) -> list(char)
kth-largest with k=2
([10, 5, 5],)
5
list(int) -> int
drop first word delimited by ' '
('S 2 86 178',)
2 86 178
list(char) -> list(char)
Drop last 5 characters
('Mcgaughey',)
Mcga
list(char) -> list(char)
nth (n=0) word delimited by ')'
('L)40)591)W',)
L
list(char) -> list(char)
keep eq 0
([2, 4, 5, 6, 1],)
[]
list(int) -> list(int)
bool-identify-is-prime
([2, 0],)
[True, False]
list(int) -> list(bool)
Append '+138'
('Cornell',)
Cornell+138
list(char) -> list(char)
Prepend '+167' to first word
('Madelaine Carlene',)
+167Madelaine
list(char) -> list(char)
bool-identify-k with k=4
([15, 1, 2, 7, 5, 4, 0],)
[False, False, False, False, False, True, False]
list(int) -> list(bool)
slice-k-n with k=5 and n=2
([1, 12, 11, 6, 4, 4, 16, 9, 10, 0, 4],)
[4, 4]
list(int) -> list(int)
Append two words delimited by ' -'
('2', 'J')
2 -J
list(char) -> list(char) -> list(char)
Take first character and append '('
('82',)
8(
list(char) -> list(char)
bool-identify-k with k=4
([4, 4, 4, 4, 4],)
[True, True, True, True, True]
list(int) -> list(bool)
replace-all-with-index-k with k=4
([0, 15, 16, 5],)
[5, 5, 5, 5]
list(int) -> list(int)
Append 2 strings (II)
('245', 'Casler')
245Casler
list(char) -> list(char) -> list(char)
Prepend '+167' to first word
('+169 29',)
+167+169
list(char) -> list(char)
product
([3, 1, 5, 9, 13],)
1755
list(int) -> int
caesar-cipher-k-modulo-n with k=2 and n=5
([0],)
[2]
list(int) -> list(int)
keep gt 3
([0, 0, 6, 6, 4],)
[6, 6, 4]
list(int) -> list(int)
slice-k-n with k=3 and n=2
([1, 0, 11, 10, 7, 15, 3],)
[11, 10]
list(int) -> list(int)
parentheses around a single word (II)
('B',)
(B)
list(char) -> list(char)
is-mod-k with k=3
([36, 27, 45, 21, 18, 45],)
True
list(int) -> bool
nth (n=0) word delimited by '('
('B(23',)
B
list(char) -> list(char)
replace-all-with-index-k with k=5
([10, 16, 9, 13, 14, 13],)
[14, 14, 14, 14, 14, 14]
list(int) -> list(int)
Prepend 'UCLA'
('Sergienko',)
UCLASergienko
list(char) -> list(char)
add-k with k=2
([2, 4, 3, 13, 13],)
[4, 6, 5, 15, 15]
list(int) -> list(int)
keep-mod-k with k=5
([7, 5],)
[5]
list(int) -> list(int)
pop
([2, 0, 1, 11, 11, 10],)
[2, 0, 1, 11, 11]
list(int) -> list(int)
Append two words delimited by '-'
('119', 'Harvard')
119-Harvard
list(char) -> list(char) -> list(char)
modulo-k with k=3
([6, 8, 2, 2],)
[0, 2, 2, 2]
list(int) -> list(int)
keep-mod-k with k=3
([18, 0],)
[18, 0]
list(int) -> list(int)
bool-identify-is-mod-k with k=4
([9, 4, 5],)
[False, True, False]
list(int) -> list(bool)
kth-largest with k=1
([0, 1, 2, 7, 16, 3],)
16
list(int) -> int
Abbreviate words separated by ','
('Trinidad,58',)
T.5.
list(char) -> list(char)
Append two words delimited by ')'
('Storrs', 'Jacquiline')
Storrs)Jacquiline
list(char) -> list(char) -> list(char)
bool-identify-k with k=2
([2],)
[True]
list(int) -> list(bool)
remove eq 1
([3, 0, 2, 3, 0],)
[3, 0, 2, 3, 0]
list(int) -> list(int)
slice-k-n with k=3 and n=3
([1, 15, 7, 4, 2, 15, 1, 7, 10, 3],)
[7, 4, 2]
list(int) -> list(int)
remove gt 3
([0, 3, 1, 0, 0],)
[0, 3, 1, 0, 0]
list(int) -> list(int)
drop-k with k=2
([12, 5, 7, 15, 6],)
[7, 15, 6]
list(int) -> list(int)
First letters of words (II)
('438 20 MA FreeHafer',)
42MF
list(char) -> list(char)
bool-identify-is-mod-k with k=4
([14],)
[False]
list(int) -> list(bool)
Append two words delimited by ' -'
('779', 'Withers')
779 -Withers
list(char) -> list(char) -> list(char)
drop first word delimited by ' '
('Bess Berkeley',)
Berkeley
list(char) -> list(char)
append-k with k=0
([2, 2, 9],)
[2, 2, 9, 0]
list(int) -> list(int)
index-k with k=1
([8, 1, 10, 4, 3],)
8
list(int) -> int
parentheses around a single word (IIII)
('986',)
(986)
list(char) -> list(char)
remove eq 2
([4, 6, 3, 4, 6],)
[4, 6, 3, 4, 6]
list(int) -> list(int)
Take first 2 characters
('334',)
33
list(char) -> list(char)
Abbreviate words separated by '-'
('Cruz-150',)
C.1.
list(char) -> list(char)
has-k with k=2
([9, 6],)
False
list(int) -> bool
prepend-index-k with k=1
([16, 0, 8],)
[16, 16, 0, 8]
list(int) -> list(int)
caesar-cipher-k-modulo-n with k=4 and n=5
([4, 2, 2],)
[3, 1, 1]
list(int) -> list(int)
kth-smallest with k=5
([14, 6, 15, 10, 7, 8, 16, 16, 14],)
14
list(int) -> int
bool-identify-geq-k with k=3
([2, 9, 2, 2, 2],)
[False, True, False, False, False]
list(int) -> list(bool)
parentheses around a single word (IIIII)
('York',)
(York)
list(char) -> list(char)
remove-mod-head
([3, 1, 3, 4, 7, 6, 9, 2],)
[1, 4, 7, 2]
list(int) -> list(int)
Take first 4 characters
('Ducati250',)
Duca
list(char) -> list(char)
nth (n=1) word delimited by ' '
('+132 Annalisa Mcgaughey Ferrari',)
Annalisa
list(char) -> list(char)
keep-mod-k with k=3
([3, 4, 13, 10, 0],)
[3, 0]
list(int) -> list(int)
index-k with k=4
([14, 9, 7, 11],)
11
list(int) -> int
slice-k-n with k=3 and n=1
([12, 4, 7, 0, 3, 9, 10, 5, 0, 10, 10, 14],)
[7]
list(int) -> list(int)
rotate-k with k=1
([10, 2, 5, 10, 14, 15, 9, 11, 13, 5, 15, 1, 15, 0, 9, 0, 12],)
[12, 10, 2, 5, 10, 14, 15, 9, 11, 13, 5, 15, 1, 15, 0, 9, 0]
list(int) -> list(int)
len
([2, 7],)
2
list(int) -> int
Take first 2 characters
('Stefany',)
St
list(char) -> list(char)
kth-smallest with k=5
([9, 11, 7, 13, 15, 10, 10, 8],)
10
list(int) -> int
Extract word delimited by ')' - '-'
('141)Penn-Jani-Clasen',)
Penn
list(char) -> list(char)
pow-k with k=5
([0, 13, 1, 10, 5, 2, 8],)
[0, 371293, 1, 100000, 3125, 32, 32768]
list(int) -> list(int)
Abbreviate words separated by ','
('FreeHafer,Park',)
F.P.
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=2 and n=3
([0, 0, 0, 2, 2],)
[2, 2, 2, 1, 1]
list(int) -> list(int)
bool-identify-k with k=1
([],)
[]
list(int) -> list(bool)
caesar-cipher-k-modulo-n with k=5 and n=4
([3, 1, 2, 1, 1],)
[0, 2, 3, 2, 2]
list(int) -> list(int)
keep gt 0
([5, 0, 0, 4, 4],)
[5, 4, 4]
list(int) -> list(int)
append-k with k=2
([4, 13, 1, 7, 8],)
[4, 13, 1, 7, 8, 2]
list(int) -> list(int)
empty
([6, 0, 14, 0, 2, 12],)
False
list(int) -> bool
drop first word delimited by ','
('+6,Micha,167',)
Micha,167
list(char) -> list(char)
slice-k-n with k=3 and n=4
([9, 0, 6, 6, 12, 7, 3, 13, 8],)
[6, 6, 12, 7]
list(int) -> list(int)
reverse
([8, 7, 11, 7, 15, 11],)
[11, 15, 7, 11, 7, 8]
list(int) -> list(int)
Take first character and append '('
('82',)
8(
list(char) -> list(char)
is-mod-k with k=3
([],)
True
list(int) -> bool
First letters of words (IIII)
('Spell 865 169 095',)
S810
list(char) -> list(char)
sort
([13],)
[13]
list(int) -> list(int)
keep-mod-head
([7, 13],)
[]
list(int) -> list(int)
count-k with k=3
([12, 3, 14],)
1
list(int) -> int
has-k with k=1
([0, 0, 5, 3],)
False
list(int) -> bool
ensure suffix `997`
('Quashie Miah',)
Quashie Miah997
list(char) -> list(char)
keep-mod-head
([10, 2, 12, 9],)
[]
list(int) -> list(int)
Abbreviate separate words (III)
('692', 'Soderstrom')
6.S.
list(char) -> list(char) -> list(char)
repeat-k with k=5
([3, 15, 14, 3, 5],)
[3, 15, 14, 3, 5, 3, 15, 14, 3, 5, 3, 15, 14, 3, 5, 3, 15, 14, 3, 5, 3, 15, 14, 3, 5]
list(int) -> list(int)
Take first character and append ','
('546',)
5,
list(char) -> list(char)
Take first character and append ' '
('MI',)
M
list(char) -> list(char)
keep-mod-k with k=5
([11, 8, 16, 13],)
[]
list(int) -> list(int)
count-k with k=5
([8],)
0
list(int) -> int
Replace '.' w/ ')'
('622.270',)
622)270
list(char) -> list(char)