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
bool-identify-k with k=1
([],)
[]
list(int) -> list(bool)
Replace '-' w/ ','
('834-Cruz-+197-Clasen',)
834,Cruz,+197,Clasen
list(char) -> list(char)
ensure suffix `997`
('+163 +129997',)
+163 +129997
list(char) -> list(char)
ensure suffix `Scalia`
('UIUC 526',)
UIUC 526Scalia
list(char) -> list(char)
is-mod-k with k=4
([10, 15, 6, 9, 16, 12],)
False
list(int) -> bool
Take first character and append '.'
('290',)
2.
list(char) -> list(char)
keep primes
([9, 6, 11, 8, 0, 17, 31],)
[11, 17, 31]
list(int) -> list(int)
has-k with k=1
([6, 14, 4],)
False
list(int) -> bool
First letters of words (III)
('000 Dermody +196',)
0D+
list(char) -> list(char)
bool-identify-is-prime
([2, 3, 4, 5, 7, 9],)
[True, True, False, True, True, False]
list(int) -> list(bool)
bool-identify-k with k=1
([1, 16, 1],)
[True, False, True]
list(int) -> list(bool)
caesar-cipher-k-modulo-n with k=1 and n=5
([],)
[]
list(int) -> list(int)
parentheses around a single word (III)
('Park',)
(Park)
list(char) -> list(char)
kth-smallest with k=5
([10, 3, 8, 6, 6, 11, 3, 4, 1, 4, 8],)
4
list(int) -> int
ensure suffix `997`
('Marcus +108 Ramthun Rudolf',)
Marcus +108 Ramthun Rudolf997
list(char) -> list(char)
repeat-k with k=2
([13],)
[13, 13]
list(int) -> list(int)
Append 2 strings (III)
('25', '176')
25176
list(char) -> list(char) -> list(char)
bool-identify-k with k=4
([4, 4, 14, 4, 16],)
[True, True, False, True, False]
list(int) -> list(bool)
Prepend 'Carlene' to first word
('+155 45',)
Carlene+155
list(char) -> list(char)
append-index-k with k=3
([6, 8, 2, 6, 7, 14, 9],)
[6, 8, 2, 6, 7, 14, 9, 2]
list(int) -> list(int)
fibonacci
(4,)
3
int -> int
Take first 3 characters
('Trinidad',)
Tri
list(char) -> list(char)
Append two words delimited by '('
('176', 'C')
176(C
list(char) -> list(char) -> list(char)
First letters of words (IIIIII)
('+155 174 Dr Haven',)
+1DH
list(char) -> list(char)
modulo-k with k=5
([5, 6, 0, 9],)
[0, 1, 0, 4]
list(int) -> list(int)
Extract word delimited by '-' - ')'
('York-Mackenzie)Jacquiline)L',)
Mackenzie
list(char) -> list(char)
range
(5,)
[0, 1, 2, 3, 4]
int -> list(int)
append-index-k with k=2
([11, 4],)
[11, 4, 4]
list(int) -> list(int)
Take first 4 characters
('Ducati250',)
Duca
list(char) -> list(char)
ensure suffix `769`
('Andria +140 Spell',)
Andria +140 Spell769
list(char) -> list(char)
append-index-k with k=4
([5, 2, 13, 3, 0, 8],)
[5, 2, 13, 3, 0, 8, 3]
list(int) -> list(int)
Append 2 strings (IIIIII)
('Miah', '81')
Miah81
list(char) -> list(char) -> list(char)
fibonacci
(6,)
8
int -> int
Append 2 strings (I)
('Richert', 'NY')
RichertNY
list(char) -> list(char) -> list(char)
Abbreviate separate words (I)
('62', 'Ramthun')
6.R.
list(char) -> list(char) -> list(char)
Replace '(' w/ '.'
('Spagnoli(7(Seamons',)
Spagnoli.7.Seamons
list(char) -> list(char)
Prepend 'Carlene' to first word
('997 CA',)
Carlene997
list(char) -> list(char)
Abbreviate separate words (IIII)
('M', '145')
M.1.
list(char) -> list(char) -> list(char)
bool-identify-is-prime
([7, 4, 11],)
[True, False, True]
list(int) -> list(bool)
index-head
([4, 9, 7, 7, 3, 2],)
3
list(int) -> int
kth-smallest with k=5
([3, 11, 8, 10, 9, 8],)
10
list(int) -> int
Replace '(' w/ '.'
('155(Edison(CA(29',)
155.Edison.CA.29
list(char) -> list(char)
Prepend 'Spell'
('358',)
Spell358
list(char) -> list(char)
prepend-index-k with k=2
([6, 6, 3, 5],)
[6, 6, 6, 3, 5]
list(int) -> list(int)
parentheses around word delimited by '.' & ','
('.+197,64',)
.(+197),64
list(char) -> list(char)
bool-identify-k with k=5
([5, 0],)
[True, False]
list(int) -> list(bool)
+1 maximum list
([4, 9],)
10
list(int) -> int
remove-mod-head
([10, 8, 7],)
[8, 7]
list(int) -> list(int)
First letters of words (I)
('81 Heintz Pannell',)
8HP
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=2 and n=4
([],)
[]
list(int) -> list(int)
bool-identify-geq-k with k=0
([3, 10, 8, 13, 11, 15],)
[True, True, True, True, True, True]
list(int) -> list(bool)
Take first character and append '.'
('Marquess',)
M.
list(char) -> list(char)
parentheses around a single word (I)
('+176',)
(+176)
list(char) -> list(char)
Prepend 'Hornak'
('H',)
HornakH
list(char) -> list(char)
remove empty lists
([[], [True], [], [False, False, True]],)
[[True], [False, False, True]]
list(list(bool)) -> list(list(bool))
slice-k-n with k=3 and n=3
([4, 6, 3, 11, 8, 0, 13, 2, 12, 10, 12, 12, 15],)
[3, 11, 8]
list(int) -> list(int)
Append 'Dermody'
('+5',)
+5Dermody
list(char) -> list(char)
Abbreviate words separated by ','
('R,+108',)
R.+.
list(char) -> list(char)
slice-k-n with k=5 and n=1
([16, 12, 11, 12, 3, 4, 0, 2, 13, 16, 6, 13, 5],)
[3]
list(int) -> list(int)
count-k with k=0
([],)
0
list(int) -> int
drop first word delimited by ','
('943,65,216,CA',)
65,216,CA
list(char) -> list(char)
Abbreviate words separated by ','
('FreeHafer,Park',)
F.P.
list(char) -> list(char)
nth (n=1) word delimited by '('
('Andria(736(654',)
736
list(char) -> list(char)
Drop last 2 characters
('Nancy',)
Nan
list(char) -> list(char)
add-k with k=2
([9, 12, 16, 9],)
[11, 14, 18, 11]
list(int) -> list(int)
drop first word delimited by '.'
('Angeles.+115.+140',)
+115.+140
list(char) -> list(char)
Take first character and append '.'
('290',)
2.
list(char) -> list(char)
First letters of words (II)
('365 Aylward',)
3A
list(char) -> list(char)
take-k with k=5
([7, 13, 0, 4, 14, 10, 10],)
[7, 13, 0, 4, 14]
list(int) -> list(int)
head
([8, 7],)
8
list(int) -> int
drop-k with k=1
([15, 8, 10, 1, 14, 1, 3],)
[8, 10, 1, 14, 1, 3]
list(int) -> list(int)
is-mod-k with k=4
([24, 20, 0, 28],)
True
list(int) -> bool
last
([0],)
0
list(int) -> int
+1 maximum list
([3, 3, 7, 4, 7],)
8
list(int) -> int
repeat-k with k=4
([6, 5],)
[6, 5, 6, 5, 6, 5, 6, 5]
list(int) -> list(int)
nth (n=1) word delimited by '.'
('Ducati125.of.588.843',)
of
list(char) -> list(char)
empty
([2, 16, 2, 5, 15, 6, 7],)
False
list(int) -> bool
Append two words delimited by '. '
('Philadelphia', '433')
Philadelphia. 433
list(char) -> list(char) -> list(char)
keep-mod-k with k=2
([0, 15, 9, 13, 13, 15, 3],)
[0]
list(int) -> list(int)
Abbreviate words separated by ','
('Rice,883',)
R.8.
list(char) -> list(char)
repeat
([4, 3],)
[3, 3, 3, 3]
list(int) -> list(int)
Prepend '170' to first word
('of Latimore',)
170of
list(char) -> list(char)
ensure suffix `568`
('MD Hopkins 394',)
MD Hopkins 394568
list(char) -> list(char)
remove empty lists
([[True, True], [], [False], []],)
[[True, True], [False]]
list(list(bool)) -> list(list(bool))
is-primes
([5, 13, 7, 5],)
True
list(int) -> bool
ensure suffix `997`
('+163 +129997',)
+163 +129997
list(char) -> list(char)
add-k with k=5
([7, 7, 0],)
[12, 12, 5]
list(int) -> list(int)
parentheses around second word
('O Jeanice',)
(Jeanice)
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=5 and n=2
([1, 1, 1, 0, 1, 1, 0],)
[0, 0, 0, 1, 0, 0, 1]
list(int) -> list(int)
keep-mod-k with k=5
([20],)
[20]
list(int) -> list(int)
caesar-cipher-k-modulo-n with k=5 and n=4
([2, 0, 0, 2, 1, 0],)
[3, 1, 1, 3, 2, 1]
list(int) -> list(int)
take-k with k=1
([15, 0, 4, 1],)
[15]
list(int) -> list(int)
has-k with k=2
([2, 2, 2, 2, 2],)
True
list(int) -> bool
remove-index-k with k=3
([5, 11, 2, 10, 13, 9, 13],)
[5, 11, 10, 13, 9, 13]
list(int) -> list(int)
drop first word delimited by ','
('Nancy,Beata,512,864',)
Beata,512,864
list(char) -> list(char)
Append '+138'
('Cornell',)
Cornell+138
list(char) -> list(char)
parentheses around word delimited by ',' & ' '
('29,10 Stefany +158',)
29,(10) Stefany +158
list(char) -> list(char)
Abbreviate separate words (IIIIII)
('O', 'Dr')
O.D.
list(char) -> list(char) -> list(char)
Replace '-' w/ ' '
('Jacqualine-62',)
Jacqualine 62
list(char) -> list(char)
Abbreviate separate words (II)
('Hayley', 'Ferrari')
H.F.
list(char) -> list(char) -> list(char)