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
Abbreviate separate words (I)
('Dermody', 'D')
D.D.
list(char) -> list(char) -> list(char)
remove-mod-k with k=5
([0, 5],)
[]
list(int) -> list(int)
pow-k with k=3
([12],)
[1728]
list(int) -> list(int)
nth (n=0) word delimited by '-'
('64-836-197-Michigan',)
64
list(char) -> list(char)
nth (n=1) word delimited by ')'
('UC)+176)Jeanice)+174',)
+176
list(char) -> list(char)
Prepend 'Carlene' to first word
('Gertude +198',)
CarleneGertude
list(char) -> list(char)
Prepend 'Jani'
('Ithaca',)
JaniIthaca
list(char) -> list(char)
bool-identify-is-prime
([5, 11],)
[True, True]
list(int) -> list(bool)
append-index-k with k=1
([16, 2, 5],)
[16, 2, 5, 16]
list(int) -> list(int)
keep-mod-k with k=4
([16],)
[16]
list(int) -> list(int)
nth (n=-1) word delimited by ')'
('+42)+98)+115)Junkin',)
Junkin
list(char) -> list(char)
kth-largest with k=1
([13, 2],)
13
list(int) -> int
index-k with k=5
([11, 11, 12, 5, 13, 11],)
13
list(int) -> int
repeat-k with k=3
([7, 10, 5, 13, 1],)
[7, 10, 5, 13, 1, 7, 10, 5, 13, 1, 7, 10, 5, 13, 1]
list(int) -> list(int)
caesar-cipher-k-modulo-n with k=1 and n=2
([1, 1, 0],)
[0, 0, 1]
list(int) -> list(int)
Prepend 'Carlene' to first word
('Gertude +198',)
CarleneGertude
list(char) -> list(char)
Append two words delimited by ' '
('Malissa', 'Philadelphia')
Malissa Philadelphia
list(char) -> list(char) -> list(char)
bool-identify-is-mod-k with k=2
([12],)
[True]
list(int) -> list(bool)
Append two words delimited by '..'
('Spagnoli', 'Hornak')
Spagnoli..Hornak
list(char) -> list(char) -> list(char)
remove-mod-head
([4, 2, 6, 10, 8, 12],)
[2, 6, 10]
list(int) -> list(int)
Prepend 'Hornak'
('865',)
Hornak865
list(char) -> list(char)
bool-identify-k with k=0
([],)
[]
list(int) -> list(bool)
remove-mod-k with k=3
([6, 3, 11, 12],)
[11]
list(int) -> list(int)
Append 'Dermody'
('Columbia',)
ColumbiaDermody
list(char) -> list(char)
slice-k-n with k=4 and n=1
([16, 10, 10, 2, 9, 6, 10, 4, 1, 7, 14, 8],)
[2]
list(int) -> list(int)
rotate-k with k=5
([15, 10, 0, 9, 16, 3, 3, 11, 16, 0, 1, 1, 4, 13],)
[0, 1, 1, 4, 13, 15, 10, 0, 9, 16, 3, 3, 11, 16]
list(int) -> list(int)
prepend-k with k=3
([6, 0],)
[3, 6, 0]
list(int) -> list(int)
nth (n=-1) word delimited by '('
('684(Ghoston',)
Ghoston
list(char) -> list(char)
Abbreviate separate words (IIIII)
('Ducati125', '46')
D.4.
list(char) -> list(char) -> list(char)
Abbreviate words separated by '.'
('Spagnoli.734',)
S.7.
list(char) -> list(char)
has-k with k=2
([2, 3, 6, 6, 7, 7],)
True
list(int) -> bool
parentheses around a single word (IIII)
('+176',)
(+176)
list(char) -> list(char)
Drop last 4 characters
('Jenee',)
J
list(char) -> list(char)
has-k with k=4
([16, 14, 7, 8, 7, 1, 3],)
False
list(int) -> bool
ensure suffix `568`
('+194 517 Bobo568',)
+194 517 Bobo568
list(char) -> list(char)
index-head
([2, 0, 15, 9, 10, 14],)
15
list(int) -> int
Append two words delimited by '-'
('Constable', '+197')
Constable-+197
list(char) -> list(char) -> list(char)
Append 2 strings (IIIIII)
('Garrard', '+141')
Garrard+141
list(char) -> list(char) -> list(char)
Replace '-' w/ ','
('2-FreeHafer-+188',)
2,FreeHafer,+188
list(char) -> list(char)
Replace '(' w/ ')'
('Babiarz(Annalisa(+151(Samuel',)
Babiarz)Annalisa)+151)Samuel
list(char) -> list(char)
Take first 4 characters
('Haven',)
Have
list(char) -> list(char)
bool-identify-is-mod-k with k=3
([3, 3, 3, 3, 3],)
[True, True, True, True, True]
list(int) -> list(bool)
keep gt 1
([4, 1, 1, 1, 4],)
[4, 4]
list(int) -> list(int)
First letters of words (I)
('C 461 +140 Phillip',)
C4+P
list(char) -> list(char)
prepend-index-k with k=4
([7, 2, 8, 11, 5, 9, 8, 9, 7],)
[11, 7, 2, 8, 11, 5, 9, 8, 9, 7]
list(int) -> list(int)
Prepend 'Sergienko'
('F',)
SergienkoF
list(char) -> list(char)
Append 2 strings (IIII)
('426', '369')
426369
list(char) -> list(char) -> list(char)
remove gt 0
([5, 4, 2, 0, 6],)
[0]
list(int) -> list(int)
nth (n=0) word delimited by ')'
('+105)046)Casler',)
+105
list(char) -> list(char)
Abbreviate separate words (IIIIII)
('25', '488')
2.4.
list(char) -> list(char) -> list(char)
drop-k with k=1
([0, 1, 2, 7, 16, 3],)
[1, 2, 7, 16, 3]
list(int) -> list(int)
ensure suffix `Ramthun`
('Ghoston Bobo Scalia Chism',)
Ghoston Bobo Scalia ChismRamthun
list(char) -> list(char)
parentheses around word delimited by ',' & ' '
(',Samuel Stefany.+185',)
,(Samuel) Stefany.+185
list(char) -> list(char)
index-k with k=2
([0, 8, 11, 16, 14, 13, 8],)
8
list(int) -> int
Abbreviate separate words (IIIIII)
('Lakenya', '62')
L.6.
list(char) -> list(char) -> list(char)
sort
([9],)
[9]
list(int) -> list(int)
Append two words delimited by ' -'
('2', 'J')
2 -J
list(char) -> list(char) -> list(char)
Append two words delimited by '.'
('R', 'Rowden')
R.Rowden
list(char) -> list(char) -> list(char)
prepend-k with k=2
([4, 3, 16, 15, 0],)
[2, 4, 3, 16, 15, 0]
list(int) -> list(int)
Append '+138'
('TX',)
TX+138
list(char) -> list(char)
bool-identify-is-mod-k with k=1
([],)
[]
list(int) -> list(bool)
kth-smallest with k=3
([16, 4, 10, 7, 5, 7, 1, 2],)
4
list(int) -> int
nth (n=-1) word delimited by '.'
('N.Annalisa.Houston',)
Houston
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=2 and n=4
([1, 2],)
[3, 0]
list(int) -> list(int)
Append 2 strings (IIIIII)
('O', '765')
O765
list(char) -> list(char) -> list(char)
nth (n=-1) word delimited by ','
('50,+9',)
+9
list(char) -> list(char)
Take first 5 characters
('Gregori',)
Grego
list(char) -> list(char)
drop first word delimited by '('
('+9(Urbana',)
Urbana
list(char) -> list(char)
Append 2 strings (I)
('Phialdelphia', '40')
Phialdelphia40
list(char) -> list(char) -> list(char)
modulo-k with k=3
([12, 4, 8, 11, 0, 8, 11],)
[0, 1, 2, 2, 0, 2, 2]
list(int) -> list(int)
Abbreviate separate words (IIIII)
('50', 'PA')
5.P.
list(char) -> list(char) -> list(char)
slice-k-n with k=4 and n=4
([2, 0, 10, 7, 5, 12, 15, 2, 11, 11, 7, 3, 8, 2],)
[7, 5, 12, 15]
list(int) -> list(int)
add-k with k=1
([4, 14, 1],)
[5, 15, 2]
list(int) -> list(int)
keep eq 2
([3, 6, 5, 6, 6],)
[]
list(int) -> list(int)
parentheses around first word
('TX 33 Pennsylvania',)
(TX)
list(char) -> list(char)
nth (n=-1) word delimited by ','
('+194,Scalia,Montiel,Ghoston',)
Ghoston
list(char) -> list(char)
drop first word delimited by ' '
('141 Lashanda',)
Lashanda
list(char) -> list(char)
Replace ',' w/ '('
('Nancy,334,611,+172',)
Nancy(334(611(+172
list(char) -> list(char)
index-k with k=4
([12, 9, 0, 0, 5],)
0
list(int) -> int
Drop last 1 characters
('290',)
29
list(char) -> list(char)
slice-k-n with k=5 and n=1
([8, 2, 13, 14, 12, 1, 7, 1, 13, 4, 5],)
[12]
list(int) -> list(int)
bool-identify-k with k=4
([],)
[]
list(int) -> list(bool)
Append 2 strings (IIIII)
('Alaina', '7')
Alaina7
list(char) -> list(char) -> list(char)
drop first word delimited by '.'
('598.849.854.Kimberley',)
849.854.Kimberley
list(char) -> list(char)
Abbreviate separate words (I)
('62', 'Ramthun')
6.R.
list(char) -> list(char) -> list(char)
Drop last 2 characters
('MI',)
null
list(char) -> list(char)
keep gt 0
([3, 0, 1, 5, 6],)
[3, 1, 5, 6]
list(int) -> list(int)
remove empty lists
([[], [True, False], [], []],)
[[True, False]]
list(list(bool)) -> list(list(bool))
First letters of words (IIIIII)
('21 B',)
2B
list(char) -> list(char)
Extract word delimited by ')' - '-'
('141)Penn-Jani-Clasen',)
Penn
list(char) -> list(char)
pop
([4, 11, 7],)
[4, 11]
list(int) -> list(int)
Replace '(' w/ ')'
('14(Micha',)
14)Micha
list(char) -> list(char)
count-k with k=5
([5],)
1
list(int) -> int
count-k with k=4
([4],)
1
list(int) -> int
repeat-k with k=5
([4, 8, 16, 4],)
[4, 8, 16, 4, 4, 8, 16, 4, 4, 8, 16, 4, 4, 8, 16, 4, 4, 8, 16, 4]
list(int) -> list(int)
Take first character and append ' '
('Jan',)
J
list(char) -> list(char)
count-head-in-tail
([1, 2, 3],)
0
list(int) -> int
Append two words delimited by '.'
('+2', 'Jacquiline')
+2.Jacquiline
list(char) -> list(char) -> list(char)
Abbreviate words separated by ' '
('+104 Hayley',)
+.H.
list(char) -> list(char)
kth-largest with k=4
([14, 4, 4, 13, 12],)
4
list(int) -> int