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
Replace ',' w/ '('
('+132,Tobias',)
+132(Tobias
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=3 and n=5
([1],)
[4]
list(int) -> list(int)
bool-identify-k with k=4
([4, 13, 10, 4, 4, 4],)
[True, False, False, True, True, True]
list(int) -> list(bool)
Abbreviate words separated by '-'
('941-162',)
9.1.
list(char) -> list(char)
remove eq 0
([2, 3, 5, 0, 0],)
[2, 3, 5]
list(int) -> list(int)
Drop last 3 characters
('857',)
null
list(char) -> list(char)
nth (n=1) word delimited by '-'
('+155-Covelli-Constable-405',)
Covelli
list(char) -> list(char)
drop first word delimited by ' '
('141 Lashanda',)
Lashanda
list(char) -> list(char)
parentheses around a single word (IIIII)
('Acura',)
(Acura)
list(char) -> list(char)
drop first word delimited by '.'
('598.849.854.Kimberley',)
849.854.Kimberley
list(char) -> list(char)
slice-k-n with k=3 and n=3
([3, 9, 3, 2, 14, 6, 2, 8, 14],)
[3, 2, 14]
list(int) -> list(int)
caesar-cipher-k-modulo-n with k=2 and n=3
([1, 0, 1, 1, 1],)
[0, 2, 0, 0, 0]
list(int) -> list(int)
Abbreviate words separated by '('
('+180(P',)
+.P.
list(char) -> list(char)
parentheses around word delimited by '-' & '.'
('-Spell.Rowden Arbor',)
-(Spell).Rowden Arbor
list(char) -> list(char)
bool-identify-is-mod-k with k=5
([2, 9, 3, 5, 16, 5],)
[False, False, False, True, False, True]
list(int) -> list(bool)
slice-k-n with k=5 and n=4
([16, 3, 10, 5, 6, 16, 1, 11, 7, 13, 13, 13, 4],)
[6, 16, 1, 11]
list(int) -> list(int)
Take first character and append ')'
('+169',)
+)
list(char) -> list(char)
kth-smallest with k=5
([14, 1, 15, 6, 0, 12, 11, 3, 15, 14],)
11
list(int) -> int
kth-smallest with k=3
([1, 7, 3],)
7
list(int) -> int
Abbreviate separate words (II)
('Hayley', 'Ferrari')
H.F.
list(char) -> list(char) -> list(char)
range
(7,)
[0, 1, 2, 3, 4, 5, 6]
int -> list(int)
count-k with k=1
([1, 1, 1, 4, 1, 1],)
5
list(int) -> int
slice-k-n with k=5 and n=3
([14, 7, 15, 6, 10, 9, 8, 11, 2, 11],)
[10, 9, 8]
list(int) -> list(int)
Abbreviate separate words (IIIIII)
('Lakenya', '62')
L.6.
list(char) -> list(char) -> list(char)
Append 2 strings (IIIII)
('Alaina', '7')
Alaina7
list(char) -> list(char) -> list(char)
modulo-k with k=1
([0, 15, 15, 16, 9],)
[0, 0, 0, 0, 0]
list(int) -> list(int)
keep gt 0
([4, 6, 4, 1, 6],)
[4, 6, 4, 1, 6]
list(int) -> list(int)
Take first 5 characters
('Gregori',)
Grego
list(char) -> list(char)
bool-identify-geq-k with k=5
([12, 10, 6, 6, 12],)
[True, True, True, True, True]
list(int) -> list(bool)
take-k with k=1
([2, 10, 15, 3, 11],)
[2]
list(int) -> list(int)
Append 2 strings (IIIII)
('Madelaine', '29')
Madelaine29
list(char) -> list(char) -> list(char)
drop first word delimited by '('
('Ducati(969(+144(Olague',)
969(+144(Olague
list(char) -> list(char)
Take first 2 characters
('Dermody',)
De
list(char) -> list(char)
kth-smallest with k=2
([3, 11],)
11
list(int) -> int
Abbreviate separate words (II)
('Hayley', 'Ferrari')
H.F.
list(char) -> list(char) -> list(char)
bool-identify-is-prime
([5, 14, 10, 15, 6],)
[True, False, False, False, False]
list(int) -> list(bool)
slice-k-n with k=4 and n=5
([7, 4, 12, 1, 11, 13, 14, 11, 11, 2, 2, 0, 14, 15],)
[1, 11, 13, 14, 11]
list(int) -> list(int)
Append two words delimited by '. '
('771', '5')
771. 5
list(char) -> list(char) -> list(char)
add-k with k=2
([9, 4, 9, 6],)
[11, 6, 11, 8]
list(int) -> list(int)
nth (n=1) word delimited by '-'
('Kotas-028',)
028
list(char) -> list(char)
mult-k with k=5
([8, 15, 9, 0, 1],)
[40, 75, 45, 0, 5]
list(int) -> list(int)
remove gt 0
([4, 3, 5, 1, 1],)
[]
list(int) -> list(int)
keep-mod-head
([7, 3, 9],)
[]
list(int) -> list(int)
prepend-k with k=4
([0, 7, 1, 14],)
[4, 0, 7, 1, 14]
list(int) -> list(int)
bool-identify-k with k=2
([2, 12, 11, 5, 12, 1],)
[True, False, False, False, False, False]
list(int) -> list(bool)
is-mod-k with k=4
([7, 7, 6],)
False
list(int) -> bool
Append 'Beata'
('997',)
997Beata
list(char) -> list(char)
has-k with k=0
([],)
False
list(int) -> bool
remove-mod-head
([8, 6, 7, 15, 2],)
[6, 7, 15, 2]
list(int) -> list(int)
keep-mod-k with k=2
([9, 4, 1, 5, 8],)
[4, 8]
list(int) -> list(int)
append-index-k with k=1
([11, 7, 6, 4, 9, 4, 15, 16],)
[11, 7, 6, 4, 9, 4, 15, 16, 11]
list(int) -> list(int)
drop first word delimited by ' '
('S 2 86 178',)
2 86 178
list(char) -> list(char)
Take first character and append ' '
('Alida',)
A
list(char) -> list(char)
Append 2 strings (III)
('35', '981')
35981
list(char) -> list(char) -> list(char)
modulo-k with k=5
([],)
[]
list(int) -> list(int)
parentheses around second word
('California 86',)
(86)
list(char) -> list(char)
Replace ' ' w/ '('
('035 Penn Hornak',)
035(Penn(Hornak
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=3 and n=4
([0],)
[3]
list(int) -> list(int)
nth (n=0) word delimited by '('
('B(23',)
B
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=2 and n=3
([1, 0, 1, 1],)
[0, 2, 0, 0]
list(int) -> list(int)
Append two words delimited by '(,'
('50', '949')
50(,949
list(char) -> list(char) -> list(char)
max
([16, 8],)
16
list(int) -> int
tail
([6, 8, 2, 7, 6, 9, 8],)
[8, 2, 7, 6, 9, 8]
list(int) -> list(int)
First letters of words (IIIII)
('Honda550 +180 Q',)
H+Q
list(char) -> list(char)
slice-k-n with k=1 and n=4
([2, 13, 1, 16, 9, 5, 16, 16, 4, 1, 8],)
[2, 13, 1, 16]
list(int) -> list(int)
ensure suffix `Ramthun`
('107 CollegeRamthun',)
107 CollegeRamthun
list(char) -> list(char)
Replace '.' w/ ')'
('Lakenya.876.18.064',)
Lakenya)876)18)064
list(char) -> list(char)
keep eq 3
([3, 0, 5, 0, 6],)
[3]
list(int) -> list(int)
Take first character and append '-'
('Chong',)
C-
list(char) -> list(char)
Drop last 1 characters
('+130',)
+13
list(char) -> list(char)
Prepend 'Ghoston' to first word
('125 +118',)
Ghoston125
list(char) -> list(char)
append-index-k with k=3
([9, 5, 2, 15, 8, 1],)
[9, 5, 2, 15, 8, 1, 2]
list(int) -> list(int)
is-mod-k with k=5
([16, 11, 14, 5],)
False
list(int) -> bool
Abbreviate separate words (IIIII)
('Ducati125', '46')
D.4.
list(char) -> list(char) -> list(char)
modulo-k with k=4
([3, 8, 1, 11, 6],)
[3, 0, 1, 3, 2]
list(int) -> list(int)
Prepend '+167' to first word
('Madelaine Carlene',)
+167Madelaine
list(char) -> list(char)
prepend-index-k with k=3
([6, 3, 0, 5, 4, 2],)
[0, 6, 3, 0, 5, 4, 2]
list(int) -> list(int)
keep gt 1
([0, 3, 0, 3, 3],)
[3, 3, 3]
list(int) -> list(int)
First letters of words (II)
('6 Kimberley 095',)
6K0
list(char) -> list(char)
mult-k with k=4
([0, 11, 4, 11, 1, 6, 12],)
[0, 44, 16, 44, 4, 24, 48]
list(int) -> list(int)
caesar-cipher-k-modulo-n with k=1 and n=5
([4, 2, 2],)
[0, 3, 3]
list(int) -> list(int)
Prepend 'Ghoston' to first word
('FreeHafer 47',)
GhostonFreeHafer
list(char) -> list(char)
Drop last 4 characters
('Santa',)
S
list(char) -> list(char)
kth-largest with k=3
([9, 0, 5, 8, 5, 8, 13],)
8
list(int) -> int
parentheses around a single word (III)
('Lain',)
(Lain)
list(char) -> list(char)
slice-k-n with k=5 and n=2
([9, 7, 1, 9, 14, 0, 9, 4, 14, 16, 8, 0, 4],)
[14, 0]
list(int) -> list(int)
mult-k with k=3
([12, 14, 13, 5, 8, 8, 9],)
[36, 42, 39, 15, 24, 24, 27]
list(int) -> list(int)
slice-k-n with k=3 and n=4
([8, 7, 16, 2, 13, 8, 14, 14, 15, 9, 8, 9, 1],)
[16, 2, 13, 8]
list(int) -> list(int)
Append two words delimited by ' '
('2', '+151')
2 +151
list(char) -> list(char) -> list(char)
drop-k with k=1
([11, 2, 10, 10],)
[2, 10, 10]
list(int) -> list(int)
ensure suffix `Andria`
('Madelaine +189Andria',)
Madelaine +189Andria
list(char) -> list(char)
bool-identify-k with k=5
([8],)
[False]
list(int) -> list(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)
Append 'Dermody'
('Columbia',)
ColumbiaDermody
list(char) -> list(char)
Replace ',' w/ '.'
('Reily,Madelaine',)
Reily.Madelaine
list(char) -> list(char)
remove-mod-k with k=2
([],)
[]
list(int) -> list(int)
nth (n=0) word delimited by ')'
('E)844',)
E
list(char) -> list(char)
prepend-k with k=3
([11, 14, 7],)
[3, 11, 14, 7]
list(int) -> list(int)
Drop last 4 characters
('Santa',)
S
list(char) -> list(char)
pow-k with k=4
([9],)
[6561]
list(int) -> list(int)