Datasets:
Fraser
/
dream-coder

Dataset card Data Studio Files Community
description
stringlengths
3
46
input
stringlengths
4
74
output
stringlengths
1
90
⌀
types
stringclasses
9 values
has-k with k=5
([11, 0, 5, 5, 5, 5, 5],)
True
list(int) -> bool
modulo-k with k=5
([0, 10],)
[0, 0]
list(int) -> list(int)
drop first word delimited by '('
('+9(Urbana',)
Urbana
list(char) -> list(char)
Take first character and append ','
('56',)
5,
list(char) -> list(char)
bool-identify-is-mod-k with k=5
([5],)
[True]
list(int) -> list(bool)
caesar-cipher-k-modulo-n with k=2 and n=4
([0],)
[2]
list(int) -> list(int)
Abbreviate separate words (IIII)
('S', 'Beata')
S.B.
list(char) -> list(char) -> list(char)
nth (n=1) word delimited by '-'
('+155-Covelli-Constable-405',)
Covelli
list(char) -> list(char)
Abbreviate separate words (IIIII)
('Mulloy', 'V')
M.V.
list(char) -> list(char) -> list(char)
nth (n=1) word delimited by ','
('Arbor,Scalia,Seamons,847',)
Scalia
list(char) -> list(char)
Extract word delimited by ')' - ','
('Cambridge)Storrs,449)10',)
Storrs
list(char) -> list(char)
keep squares
([9, 4, 9, 0, 5, 1, 6],)
[9, 4, 9, 0, 1]
list(int) -> list(int)
prepend-k with k=0
([12, 0, 1, 9, 4],)
[0, 12, 0, 1, 9, 4]
list(int) -> list(int)
nth (n=-1) word delimited by ')'
('539)027)42',)
42
list(char) -> list(char)
Append two words delimited by '.-'
('Philadelphia', '6')
Philadelphia.-6
list(char) -> list(char) -> list(char)
take-k with k=2
([7, 4, 4, 16],)
[7, 4]
list(int) -> list(int)
parentheses around a single word (II)
('Honda',)
(Honda)
list(char) -> list(char)
ensure suffix `Andria`
('+13 20 +7',)
+13 20 +7Andria
list(char) -> list(char)
Append 'Angeles'
('Spell',)
SpellAngeles
list(char) -> list(char)
nth (n=0) word delimited by '.'
('Maryann.705.Barbara',)
Maryann
list(char) -> list(char)
Prepend 'Carlene' to first word
('Gertude +198',)
CarleneGertude
list(char) -> list(char)
last
([4, 6, 12],)
12
list(int) -> int
drop first word delimited by '('
('75(Rice',)
Rice
list(char) -> list(char)
slice-k-n with k=3 and n=3
([7, 13, 9, 7, 8, 15, 9, 15, 7, 4, 9],)
[9, 7, 8]
list(int) -> list(int)
Append two words delimited by ','
('UIUC', '608')
UIUC,608
list(char) -> list(char) -> list(char)
Append 2 strings (IIIIII)
('+199', '919')
+199919
list(char) -> list(char) -> list(char)
Prepend 'Hornak'
('Mackenzie',)
HornakMackenzie
list(char) -> list(char)
keep gt 0
([5, 6, 4, 2, 5],)
[5, 6, 4, 2, 5]
list(int) -> list(int)
First letters of words (IIIIII)
('21 B',)
2B
list(char) -> list(char)
Replace '.' w/ ')'
('Beata.21.119',)
Beata)21)119
list(char) -> list(char)
Take first character and append ')'
('DPhiladelphia',)
D)
list(char) -> list(char)
parentheses around word delimited by '-' & '.'
('Lain-Edison.C-Temple',)
Lain-(Edison).C-Temple
list(char) -> list(char)
rotate-k with k=4
([3, 5, 11, 7, 11, 10, 3, 14, 0],)
[10, 3, 14, 0, 3, 5, 11, 7, 11]
list(int) -> list(int)
drop first word delimited by '.'
('Angeles.+115.+140',)
+115.+140
list(char) -> list(char)
Replace '(' w/ ')'
('Hornak(Q(Mackenzie',)
Hornak)Q)Mackenzie
list(char) -> list(char)
append-index-k with k=1
([10],)
[10, 10]
list(int) -> list(int)
drop first word delimited by ','
('Rice,Partida,894,40',)
Partida,894,40
list(char) -> list(char)
nth (n=1) word delimited by ')'
('Mariel)Carlene)Ducati100)Jeff',)
Carlene
list(char) -> list(char)
pow-k with k=4
([9],)
[6561]
list(int) -> list(int)
append-k with k=0
([15, 16],)
[15, 16, 0]
list(int) -> list(int)
Append two words delimited by ','
('2', 'Garrard')
2,Garrard
list(char) -> list(char) -> list(char)
pop
([6, 8, 1, 3, 0],)
[6, 8, 1, 3]
list(int) -> list(int)
modulo-k with k=5
([],)
[]
list(int) -> list(int)
nth (n=0) word delimited by ')'
('Lara)+176',)
Lara
list(char) -> list(char)
remove gt 1
([0, 6, 0, 4, 2],)
[0, 0]
list(int) -> list(int)
nth (n=-1) word delimited by ' '
('Park +183 186',)
186
list(char) -> list(char)
pow-k with k=5
([12, 11, 8, 8],)
[248832, 161051, 32768, 32768]
list(int) -> list(int)
caesar-cipher-k-modulo-n with k=3 and n=5
([1, 1],)
[4, 4]
list(int) -> list(int)
parentheses around a single word (IIIII)
('York',)
(York)
list(char) -> list(char)
nth (n=-1) word delimited by '-'
('21-of',)
of
list(char) -> list(char)
parentheses around word delimited by ',' & ' '
(',551 Cencici 68',)
,(551) Cencici 68
list(char) -> list(char)
sort-and-deduplicate
([2, 7, 8],)
[2, 7, 8]
list(int) -> list(int)
is-mod-k with k=3
([12],)
True
list(int) -> bool
is-mod-k with k=5
([4],)
False
list(int) -> bool
bool-identify-geq-k with k=4
([7],)
[True]
list(int) -> list(bool)
Abbreviate separate words (IIIIII)
('O', 'Dr')
O.D.
list(char) -> list(char) -> list(char)
keep eq 3
([1, 5, 1, 4, 6],)
[]
list(int) -> list(int)
keep eq 1
([4, 3, 3, 2, 6],)
[]
list(int) -> list(int)
slice-k-n with k=3 and n=2
([7, 9, 3, 7, 11, 11],)
[3, 7]
list(int) -> list(int)
Drop last 3 characters
('Hage',)
H
list(char) -> list(char)
take-k with k=2
([7, 10, 3, 0, 7, 7],)
[7, 10]
list(int) -> list(int)
Abbreviate words separated by '-'
('941-162',)
9.1.
list(char) -> list(char)
slice-k-n with k=5 and n=4
([5, 12, 3, 12, 15, 2, 6, 6, 15, 11, 16, 2],)
[15, 2, 6, 6]
list(int) -> list(int)
mult-k with k=3
([7, 10, 8, 8],)
[21, 30, 24, 24]
list(int) -> list(int)
caesar-cipher-k-modulo-n with k=5 and n=4
([0, 3, 1, 1, 0],)
[1, 0, 2, 2, 1]
list(int) -> list(int)
keep eq 0
([6, 5, 5, 6, 3],)
[]
list(int) -> list(int)
prepend-index-k with k=5
([9, 14, 2, 7, 6, 8, 8],)
[6, 9, 14, 2, 7, 6, 8, 8]
list(int) -> list(int)
slice-k-n with k=3 and n=2
([11, 0, 13, 11, 9, 7, 7, 10, 9, 2],)
[13, 11]
list(int) -> list(int)
repeat-many
([1, 1, 2, 3],)
[1, 2, 3]
list(int) -> list(int)
bool-identify-k with k=2
([2, 2, 2, 2, 2, 2, 2],)
[True, True, True, True, True, True, True]
list(int) -> list(bool)
append-k with k=1
([5, 11, 5, 15, 11, 1, 3],)
[5, 11, 5, 15, 11, 1, 3, 1]
list(int) -> list(int)
drop-k with k=4
([1, 13, 0, 6, 13],)
[13]
list(int) -> list(int)
product
([3, 1, 5, 9, 13],)
1755
list(int) -> int
prepend-k with k=5
([14, 1, 4, 13, 1, 11, 12],)
[5, 14, 1, 4, 13, 1, 11, 12]
list(int) -> list(int)
index-head
([3, 6, 13, 4, 6],)
4
list(int) -> int
add-k with k=4
([9, 3, 7, 14],)
[13, 7, 11, 18]
list(int) -> list(int)
Prepend 'Ghoston' to first word
('720 588',)
Ghoston720
list(char) -> list(char)
Append 2 strings (III)
('Tobias', '58')
Tobias58
list(char) -> list(char) -> list(char)
First letters of words (II)
('365 Aylward',)
3A
list(char) -> list(char)
parentheses around a single word (IIIII)
('York',)
(York)
list(char) -> list(char)
odds
([6, 10, 15, 8, 14, 3],)
[15, 3]
list(int) -> list(int)
remove-mod-k with k=2
([1, 15, 5],)
[1, 15, 5]
list(int) -> list(int)
First letters of words (IIIIII)
('21 B',)
2B
list(char) -> list(char)
pow-k with k=4
([12, 15],)
[20736, 50625]
list(int) -> list(int)
parentheses around a single word (I)
('+176',)
(+176)
list(char) -> list(char)
kth-largest with k=4
([0, 13, 4, 2],)
0
list(int) -> int
Prepend 'Ghoston' to first word
('720 588',)
Ghoston720
list(char) -> list(char)
slice-k-n with k=5 and n=2
([7, 15, 9, 9, 2, 2, 3, 8, 14, 6, 5, 6],)
[2, 2]
list(int) -> list(int)
bool-identify-k with k=2
([14, 0, 2, 6],)
[False, False, True, False]
list(int) -> list(bool)
kth-largest with k=3
([1, 5, 8, 16, 15, 10, 14, 11],)
14
list(int) -> int
keep squares
([1, 4, 8, 9, 1, 6, 16],)
[1, 4, 9, 1, 16]
list(int) -> list(int)
ensure suffix `Columbia`
('Cambridge MD 875 Ducati125',)
Cambridge MD 875 Ducati125Columbia
list(char) -> list(char)
Drop last 4 characters
('Santa',)
S
list(char) -> list(char)
slice-k-n with k=4 and n=5
([1, 15, 7, 1, 16, 16, 6, 8, 9, 15, 14, 1, 12],)
[1, 16, 16, 6, 8]
list(int) -> list(int)
Replace ' ' w/ '('
('+9 Rowden Reily',)
+9(Rowden(Reily
list(char) -> list(char)
nth (n=0) word delimited by '-'
('+172-Penn-Chilcott-E',)
+172
list(char) -> list(char)
ensure suffix `Andria`
('Hornak 575 MA JacquilineAndria',)
Hornak 575 MA JacquilineAndria
list(char) -> list(char)
parentheses around second word
('O Jeanice',)
(Jeanice)
list(char) -> list(char)
Append 'Beata'
('Eccleston',)
EcclestonBeata
list(char) -> list(char)
First letters of words (I)
('+118 Chism 428 Acura100',)
+C4A
list(char) -> list(char)