Datasets:
Fraser
/
dream-coder

Dataset card Data Studio Files
xet
Community
description
stringlengths
3
46
input
stringlengths
4
74
output
stringlengths
1
90
⌀
types
stringclasses
9 values
parentheses around a single word (IIIII)
('Halpern',)
(Halpern)
list(char) -> list(char)
Drop last 3 characters
('Hage',)
H
list(char) -> list(char)
parentheses around first word
('+108 29 95 +196 332',)
(+108)
list(char) -> list(char)
ensure suffix `Andria`
('Hornak 575 MA JacquilineAndria',)
Hornak 575 MA JacquilineAndria
list(char) -> list(char)
index-k with k=5
([1, 7, 3, 16, 10, 12, 14, 12, 16, 13, 8, 3],)
10
list(int) -> int
remove gt 0
([5, 0, 4, 0, 1],)
[0, 0]
list(int) -> list(int)
slice-k-n with k=5 and n=4
([11, 4, 5, 14, 3, 13, 3, 0, 8, 6, 11, 0, 0],)
[3, 13, 3, 0]
list(int) -> list(int)
mult-k with k=5
([],)
[]
list(int) -> list(int)
parentheses around a single word (IIII)
('+176',)
(+176)
list(char) -> list(char)
slice-k-n with k=4 and n=1
([4, 14, 2, 9, 2, 14, 16],)
[9]
list(int) -> list(int)
caesar-cipher-k-modulo-n with k=4 and n=5
([0],)
[4]
list(int) -> list(int)
append-k with k=4
([7, 16, 14, 12, 2],)
[7, 16, 14, 12, 2, 4]
list(int) -> list(int)
parentheses around word delimited by ',' & ','
(',548,43',)
,(548),43
list(char) -> list(char)
repeat-k with k=2
([],)
[]
list(int) -> list(int)
parentheses around a single word (III)
('Ducati',)
(Ducati)
list(char) -> list(char)
index-k with k=4
([1, 11, 7, 2, 5, 9, 11, 13, 2, 9],)
2
list(int) -> int
Replace '(' w/ ')'
('Babiarz(Annalisa(+151(Samuel',)
Babiarz)Annalisa)+151)Samuel
list(char) -> list(char)
drop-k with k=2
([0, 9, 1],)
[1]
list(int) -> list(int)
Prepend 'Spell'
('+197',)
Spell+197
list(char) -> list(char)
min
([1, 1, 2, 1],)
1
list(int) -> int
Extract word delimited by '-' - ')'
('T-188)Brendan-736',)
188
list(char) -> list(char)
kth-smallest with k=2
([9, 0, 0, 5, 14, 10, 5, 2],)
0
list(int) -> int
sum
([11],)
11
list(int) -> int
Append two words delimited by '(,'
('Harvard', '+183')
Harvard(,+183
list(char) -> list(char) -> list(char)
Prepend 'Spell'
('358',)
Spell358
list(char) -> list(char)
dup
([5],)
[5, 5]
list(int) -> list(int)
Abbreviate words separated by '-'
('Mackenzie-K',)
M.K.
list(char) -> list(char)
Replace '-' w/ ','
('2-FreeHafer-+188',)
2,FreeHafer,+188
list(char) -> list(char)
pop
([2],)
[]
list(int) -> list(int)
Drop last 2 characters
('Stefany',)
Stefa
list(char) -> list(char)
is-evens
([28],)
True
list(int) -> bool
Drop last 1 characters
('769',)
76
list(char) -> list(char)
slice-k-n with k=2 and n=4
([11, 0, 1, 12, 11, 4, 8, 0],)
[0, 1, 12, 11]
list(int) -> list(int)
prepend-k with k=0
([12, 4],)
[0, 12, 4]
list(int) -> list(int)
First letters of words (IIIIII)
('+155 174 Dr Haven',)
+1DH
list(char) -> list(char)
drop first word delimited by ' '
('141 Lashanda',)
Lashanda
list(char) -> list(char)
nth (n=-1) word delimited by ')'
('T)+197',)
+197
list(char) -> list(char)
nth (n=1) word delimited by ' '
('Soderstrom Scalia',)
Scalia
list(char) -> list(char)
count-k with k=5
([1, 6],)
0
list(int) -> int
nth (n=1) word delimited by '.'
('H.+7.Cortes.+169',)
+7
list(char) -> list(char)
remove eq 3
([4, 2, 6, 4, 6],)
[4, 2, 6, 4, 6]
list(int) -> list(int)
Take first character and append '('
('020',)
0(
list(char) -> list(char)
bool-identify-k with k=2
([2, 15],)
[True, False]
list(int) -> list(bool)
Drop last 1 characters
('290',)
29
list(char) -> list(char)
kth-largest with k=3
([2, 5, 14, 8, 8],)
8
list(int) -> int
Abbreviate separate words (I)
('+118', '894')
+.8.
list(char) -> list(char) -> list(char)
keep eq 2
([6, 1, 4, 1, 5],)
[]
list(int) -> list(int)
drop first word delimited by ','
('+6,Micha,167',)
Micha,167
list(char) -> list(char)
drop first word delimited by '('
('+9(Urbana',)
Urbana
list(char) -> list(char)
Prepend 'Spell'
('+105',)
Spell+105
list(char) -> list(char)
Replace '-' w/ ','
('2-FreeHafer-+188',)
2,FreeHafer,+188
list(char) -> list(char)
bool-identify-is-mod-k with k=1
([11, 0, 1, 1, 1, 1, 1],)
[True, True, True, True, True, True, True]
list(int) -> list(bool)
is-mod-k with k=5
([],)
True
list(int) -> bool
slice-k-n with k=3 and n=1
([1, 13, 4, 0, 8, 4],)
[4]
list(int) -> list(int)
modulo-k with k=4
([0, 1, 13, 12, 15, 10],)
[0, 1, 1, 0, 3, 2]
list(int) -> list(int)
drop first word delimited by ' '
('141 Lashanda',)
Lashanda
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=1 and n=4
([0, 2, 1, 2],)
[1, 3, 2, 3]
list(int) -> list(int)
Abbreviate words separated by '('
('048(Joaquin',)
0.J.
list(char) -> list(char)
add-k with k=5
([6, 13, 0, 2],)
[11, 18, 5, 7]
list(int) -> list(int)
Replace '(' w/ ')'
('+194(+185(+147(Rice',)
+194)+185)+147)Rice
list(char) -> list(char)
slice-k-n with k=2 and n=5
([9, 15, 11, 12, 12, 14, 9, 2, 0, 9, 15, 13, 7, 16],)
[15, 11, 12, 12, 14]
list(int) -> list(int)
repeat-k with k=4
([15, 10],)
[15, 10, 15, 10, 15, 10, 15, 10]
list(int) -> list(int)
parentheses around word delimited by ',' & ','
('100,066,Annalisa',)
100,(066),Annalisa
list(char) -> list(char)
mult-k with k=5
([3, 6, 6, 16],)
[15, 30, 30, 80]
list(int) -> list(int)
slice-k-n with k=3 and n=1
([10, 16, 10, 8, 15, 1, 14],)
[10]
list(int) -> list(int)
Prepend 'UCLA'
('Sergienko',)
UCLASergienko
list(char) -> list(char)
prepend-k with k=3
([7],)
[3, 7]
list(int) -> list(int)
bool-identify-geq-k with k=2
([],)
[]
list(int) -> list(bool)
Take first 5 characters
('Desiree',)
Desir
list(char) -> list(char)
modulo-k with k=4
([1, 14, 11, 13, 0, 3, 2],)
[1, 2, 3, 1, 0, 3, 2]
list(int) -> list(int)
Extract word delimited by ')' - ','
('963)Kathlyn,Melodi,Spagnoli',)
Kathlyn
list(char) -> list(char)
Abbreviate separate words (IIIII)
('Ducati125', '46')
D.4.
list(char) -> list(char) -> list(char)
Prepend 'Jani'
('Ithaca',)
JaniIthaca
list(char) -> list(char)
add-k with k=3
([],)
[]
list(int) -> list(int)
prepend-k with k=2
([],)
[2]
list(int) -> list(int)
Abbreviate separate words (IIIII)
('50', 'PA')
5.P.
list(char) -> list(char) -> list(char)
First letters of words (II)
('Celsa Latimore',)
CL
list(char) -> list(char)
take-k with k=4
([10, 15, 5, 3, 4, 9, 6, 14, 6],)
[10, 15, 5, 3]
list(int) -> list(int)
is-evens
([11, 16, 10, 2, 1, 8],)
False
list(int) -> bool
pow-k with k=5
([10, 8],)
[100000, 32768]
list(int) -> list(int)
min
([1, 7, 12, 6, 15, 12, 9],)
1
list(int) -> int
index-head
([1, 11],)
11
list(int) -> int
Abbreviate words separated by '.'
('Spagnoli.734',)
S.7.
list(char) -> list(char)
is-squares
([25],)
True
list(int) -> bool
remove-mod-k with k=4
([0, 24, 16, 24],)
[]
list(int) -> list(int)
append-k with k=1
([7],)
[7, 1]
list(int) -> list(int)
slice-k-n with k=1 and n=3
([1, 14, 4, 2, 7, 14],)
[1, 14, 4]
list(int) -> list(int)
has-k with k=5
([5, 5, 5],)
True
list(int) -> bool
caesar-cipher-k-modulo-n with k=1 and n=5
([4, 3, 2, 3, 3, 1],)
[0, 4, 3, 4, 4, 2]
list(int) -> list(int)
drop first word delimited by '-'
('California-+158-Ghoston-82',)
+158-Ghoston-82
list(char) -> list(char)
Append two words delimited by '(,'
('50', '949')
50(,949
list(char) -> list(char) -> list(char)
append-k with k=5
([6, 16, 1, 5, 11, 8, 5],)
[6, 16, 1, 5, 11, 8, 5, 5]
list(int) -> list(int)
kth-smallest with k=5
([12, 6, 11, 9, 3],)
12
list(int) -> int
index-k with k=1
([0, 3, 1, 6],)
0
list(int) -> int
caesar-cipher-k-modulo-n with k=1 and n=5
([],)
[]
list(int) -> list(int)
Take first 4 characters
('Haven',)
Have
list(char) -> list(char)
parentheses around first word
('018 +176 Houston',)
(018)
list(char) -> list(char)
Take first character and append '('
('020',)
0(
list(char) -> list(char)
Append two words delimited by '('
('PA', 'Dermody')
PA(Dermody
list(char) -> list(char) -> list(char)
remove-index-k with k=1
([2, 8, 12],)
[8, 12]
list(int) -> list(int)