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
caesar-cipher-k-modulo-n with k=5 and n=3
([1, 1, 0, 2],)
[0, 0, 2, 1]
list(int) -> list(int)
Abbreviate separate words (IIIIII)
('Lakenya', '62')
L.6.
list(char) -> list(char) -> list(char)
range +1 maximum list
([5, 0],)
[0, 1, 2, 3, 4, 5]
list(int) -> list(int)
Append two words delimited by '-'
('Constable', '+197')
Constable-+197
list(char) -> list(char) -> list(char)
Extract word delimited by '-' - ')'
('155-Reily)Haven)+132',)
Reily
list(char) -> list(char)
append-index-k with k=5
([6, 4, 15, 14, 7, 12, 3, 0, 4, 16],)
[6, 4, 15, 14, 7, 12, 3, 0, 4, 16, 7]
list(int) -> list(int)
index-head
([1, 10, 1, 4],)
10
list(int) -> int
kth-largest with k=3
([11, 12, 13, 4, 0, 13, 6, 9, 1, 9],)
12
list(int) -> int
count-k with k=4
([4, 4, 4, 4, 4, 4],)
6
list(int) -> int
Take first 2 characters
('Dermody',)
De
list(char) -> list(char)
has-k with k=0
([5, 7, 6, 8, 3],)
False
list(int) -> bool
caesar-cipher-k-modulo-n with k=1 and n=3
([1, 0, 1, 1],)
[2, 1, 2, 2]
list(int) -> list(int)
keep-mod-k with k=4
([36, 36, 16],)
[36, 36, 16]
list(int) -> list(int)
is-mod-k with k=4
([],)
True
list(int) -> bool
keep-mod-k with k=2
([12],)
[12]
list(int) -> list(int)
caesar-cipher-k-modulo-n with k=4 and n=5
([],)
[]
list(int) -> list(int)
parentheses around word delimited by '.' & ','
('.DPhiladelphia,+132 G',)
.(DPhiladelphia),+132 G
list(char) -> list(char)
slice-k-n with k=5 and n=5
([12, 0, 10, 14, 10, 8, 12, 8, 7, 16, 0, 8, 5, 3, 10],)
[10, 8, 12, 8, 7]
list(int) -> list(int)
ensure suffix `997`
('Quashie Miah',)
Quashie Miah997
list(char) -> list(char)
is-squares
([4, 15, 1],)
False
list(int) -> bool
slice-k-n with k=3 and n=4
([16, 4, 13, 12, 3, 14, 12, 16],)
[13, 12, 3, 14]
list(int) -> list(int)
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)
modulo-k with k=2
([14, 14, 16],)
[0, 0, 0]
list(int) -> list(int)
append-k with k=4
([11, 2, 9, 8, 8],)
[11, 2, 9, 8, 8, 4]
list(int) -> list(int)
parentheses around a single word (II)
('B',)
(B)
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=3 and n=4
([2, 3, 0, 1, 2],)
[1, 2, 3, 0, 1]
list(int) -> list(int)
slice-k-n with k=1 and n=5
([3, 0, 13, 7, 3, 5, 13, 11, 12, 5, 11],)
[3, 0, 13, 7, 3]
list(int) -> list(int)
remove-index-k with k=4
([4, 14, 15, 6],)
[4, 14, 15]
list(int) -> list(int)
remove empty lists
([[False, True], [], [], []],)
[[False, True]]
list(list(bool)) -> list(list(bool))
slice-k-n with k=2 and n=3
([16, 11, 10, 0, 7, 14],)
[11, 10, 0]
list(int) -> list(int)
bool-identify-geq-k with k=3
([4],)
[True]
list(int) -> list(bool)
range
(1,)
[0]
int -> list(int)
Drop last 1 characters
('+130',)
+13
list(char) -> list(char)
remove-mod-k with k=2
([3, 7, 1, 14],)
[3, 7, 1]
list(int) -> list(int)
Take first character and append '('
('Pennsylvania',)
P(
list(char) -> list(char)
empty
([],)
True
list(int) -> bool
Take first character and append ' '
('Alida',)
A
list(char) -> list(char)
is-mod-k with k=1
([6, 1, 13, 7],)
True
list(int) -> bool
slice-k-n with k=5 and n=5
([10, 3, 11, 16, 10, 4, 8, 12, 0, 15, 9, 4, 4, 8, 11, 11, 9, 1],)
[10, 4, 8, 12, 0]
list(int) -> list(int)
Drop last 4 characters
('+167',)
null
list(char) -> list(char)
Replace ',' w/ '.'
('Ducati,+147',)
Ducati.+147
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=1 and n=3
([1, 1, 0, 0],)
[2, 2, 1, 1]
list(int) -> list(int)
ensure suffix `997`
('Hopkins 701 F',)
Hopkins 701 F997
list(char) -> list(char)
prepend-k with k=3
([2, 5, 9, 14, 14],)
[3, 2, 5, 9, 14, 14]
list(int) -> list(int)
remove-mod-k with k=4
([11, 7, 16, 14, 13, 12, 3],)
[11, 7, 14, 13, 3]
list(int) -> list(int)
slice-k-n with k=3 and n=2
([1, 13, 12, 5, 9, 8, 6, 4, 1, 16, 12, 15, 5],)
[12, 5]
list(int) -> list(int)
append-k with k=1
([8, 14, 16, 4, 12],)
[8, 14, 16, 4, 12, 1]
list(int) -> list(int)
remove-index-k with k=1
([10],)
[]
list(int) -> list(int)
slice-k-n with k=1 and n=2
([13, 13, 8, 0, 5, 14, 0, 2],)
[13, 13]
list(int) -> list(int)
remove eq 3
([4, 5, 3, 3, 5],)
[4, 5, 5]
list(int) -> list(int)
nth (n=1) word delimited by ','
('Sergienko,009,Jacquiline,Sergienko',)
009
list(char) -> list(char)
First letters of words (III)
('Trinidad 500 862',)
T58
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=1 and n=3
([2, 2, 1, 1, 2, 1, 0],)
[0, 0, 2, 2, 0, 2, 1]
list(int) -> list(int)
remove-index-k with k=2
([12, 5, 0, 10],)
[12, 0, 10]
list(int) -> list(int)
caesar-cipher-k-modulo-n with k=5 and n=4
([],)
[]
list(int) -> list(int)
Append '636'
('C',)
C636
list(char) -> list(char)
has-k with k=0
([13],)
False
list(int) -> bool
nth (n=1) word delimited by ','
('473,Phialdelphia',)
Phialdelphia
list(char) -> list(char)
append-k with k=4
([13, 11],)
[13, 11, 4]
list(int) -> list(int)
Replace '-' w/ ','
('Georgina-Dr-Alida-Acura100',)
Georgina,Dr,Alida,Acura100
list(char) -> list(char)
parentheses around a single word (III)
('Lain',)
(Lain)
list(char) -> list(char)
bool-identify-k with k=0
([0, 7],)
[True, False]
list(int) -> list(bool)
range +1 maximum list
([5, 1],)
[0, 1, 2, 3, 4, 5]
list(int) -> list(int)
slice-k-n with k=1 and n=1
([15, 13, 8],)
[15]
list(int) -> list(int)
kth-largest with k=4
([16, 4, 13, 11, 6, 13, 16, 1, 5, 6],)
13
list(int) -> int
nth (n=1) word delimited by ')'
('UC)+176)Jeanice)+174',)
+176
list(char) -> list(char)
Drop last 2 characters
('562',)
5
list(char) -> list(char)
kth-smallest with k=4
([4, 0, 6, 0],)
6
list(int) -> int
caesar-cipher-k-modulo-n with k=4 and n=3
([0, 0],)
[1, 1]
list(int) -> list(int)
rotate-k with k=4
([5, 2, 5, 8, 2, 2, 2, 10, 12, 5, 13],)
[10, 12, 5, 13, 5, 2, 5, 8, 2, 2, 2]
list(int) -> list(int)
parentheses around a single word (II)
('29',)
(29)
list(char) -> list(char)
kth-smallest with k=2
([9, 5],)
9
list(int) -> int
remove gt 3
([3, 2, 1, 4, 5],)
[3, 2, 1]
list(int) -> list(int)
Prepend '+174'
('52',)
+17452
list(char) -> list(char)
ensure suffix `769`
('Andria +140 Spell',)
Andria +140 Spell769
list(char) -> list(char)
Append two words delimited by '. '
('Haven', '575')
Haven. 575
list(char) -> list(char) -> list(char)
Take first character and append '-'
('751',)
7-
list(char) -> list(char)
Replace '-' w/ ' '
('759-Bogle',)
759 Bogle
list(char) -> list(char)
nth (n=-1) word delimited by '-'
('Alaina-Jacquiline',)
Jacquiline
list(char) -> list(char)
Extract word delimited by '(' - '('
('14(Rowden(Jeanice(Acura125',)
Rowden
list(char) -> list(char)
Take first character and append '-'
('751',)
7-
list(char) -> list(char)
caesar-cipher-k-modulo-n with k=3 and n=5
([4, 2, 2, 0, 2],)
[2, 0, 0, 3, 0]
list(int) -> list(int)
keep eq 1
([4, 1, 5, 0, 0],)
[1]
list(int) -> list(int)
Extract word delimited by '-' - ')'
('York-Mackenzie)Jacquiline)L',)
Mackenzie
list(char) -> list(char)
Abbreviate separate words (II)
('Hayley', 'Ferrari')
H.F.
list(char) -> list(char) -> list(char)
Prepend 'Spell'
('+105',)
Spell+105
list(char) -> list(char)
has-k with k=0
([9, 12],)
False
list(int) -> bool
slice-k-n with k=2 and n=5
([14, 4, 13, 11, 12, 10, 12, 3, 1, 10, 15, 7],)
[4, 13, 11, 12, 10]
list(int) -> list(int)
slice-k-n with k=4 and n=2
([6, 6, 14, 11, 16, 9, 5, 16],)
[11, 16]
list(int) -> list(int)
prepend-k with k=3
([14, 11],)
[3, 14, 11]
list(int) -> list(int)
keep eq 1
([6, 1, 4, 1, 1],)
[1, 1, 1]
list(int) -> list(int)
nth (n=-1) word delimited by '('
('Berkeley(557(29',)
29
list(char) -> list(char)
slice-k-n with k=1 and n=5
([7, 4, 1, 16, 9, 16, 14, 6, 15, 2, 9, 1],)
[7, 4, 1, 16, 9]
list(int) -> list(int)
nth (n=1) word delimited by '.'
('Bogle.Jani',)
Jani
list(char) -> list(char)
Append 'Beata'
('092',)
092Beata
list(char) -> list(char)
slice-k-n with k=2 and n=3
([1, 5, 3, 6, 16, 9],)
[5, 3, 6]
list(int) -> list(int)
remove gt 2
([5, 2, 4, 5, 1],)
[2, 1]
list(int) -> list(int)
is-mod-k with k=2
([24, 22, 2, 14, 16, 8, 10],)
True
list(int) -> bool
append-k with k=5
([15, 0, 13],)
[15, 0, 13, 5]
list(int) -> list(int)
Extract word delimited by ',' - '.'
('504,566.20.F',)
566
list(char) -> list(char)