name stringclasses 161
values | language stringclasses 22
values | prompt stringlengths 40 2.27k | doctests stringclasses 3
values | original stringclasses 956
values | prompt_terminology stringclasses 2
values | tests stringlengths 125 5.35k | stop_tokens listlengths 1 7 |
|---|---|---|---|---|---|---|---|
HumanEval_36_fizz_buzz | jl | """Return the number of times the digit 7 appears in integers less than n which are divisible by 11 or 13.
>>> fizz_buzz(50)
0
>>> fizz_buzz(78)
2
>>> fizz_buzz(79)
3"""
function fizz_buzz(n::Int64)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_36_fizz_buzz.py | reworded | using Test
@testset begin
candidate = fizz_buzz;
@test(candidate(50) == 0)
@test(candidate(78) == 2)
@test(candidate(79) == 3)
@test(candidate(100) == 3)
@test(candidate(200) == 6)
@test(candidate(4000) == 192)
@test(candidate(10000) == 639)
@test(candidate(100000) == 8026)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_37_sort_even | jl | """This function takes a vector l and returns a vector l' such that
l' is identical to l in the odd indicies, while its values at the even indicies are equal
to the values of the even indicies of l, but sorted.
>>> sort_even([1, 2, 3])
[1, 2, 3]
>>> sort_even([5, 6, 3, 4])
[3, 6, 5, 4]"""
function sort_even(l::Vector{I... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_37_sort_even.py | reworded | using Test
@testset begin
candidate = sort_even;
@test(candidate([1, 2, 3]) == [1, 2, 3])
@test(candidate([5, 3, -5, 2, -3, 3, 9, 0, 123, 1, -10]) == [-10, 3, -5, 2, -3, 3, 5, 0, 9, 1, 123])
@test(candidate([5, 8, -12, 4, 23, 2, 3, 11, 12, -10]) == [-12, 8, 3, 4, 5, 2, 12, 11, 23, -10])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_39_prime_fib | jl | """prime_fib returns n-th number that is a Fibonacci number and it's also prime.
>>> prime_fib(1)
2
>>> prime_fib(2)
3
>>> prime_fib(3)
5
>>> prime_fib(4)
13
>>> prime_fib(5)
89"""
function prime_fib(n::Int64)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_39_prime_fib.py | reworded | using Test
@testset begin
candidate = prime_fib;
@test(candidate(1) == 2)
@test(candidate(2) == 3)
@test(candidate(3) == 5)
@test(candidate(4) == 13)
@test(candidate(5) == 89)
@test(candidate(6) == 233)
@test(candidate(7) == 1597)
@test(candidate(8) == 28657)
@test(candidate(9) == 514229)
@test(candidate(10... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_3_below_zero | jl | """ You're given a vector of deposit and withdrawal operations on a bank account that starts with
zero balance. Your task is to detect if at any point the balance of account fallls below zero, and
at that point function should return true. Otherwise it should return false.
>>> below_zero([1, 2, 3])
false
>>> below_zero... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_3_below_zero.py | reworded | using Test
@testset begin
candidate = below_zero;
@test(candidate(Vector{Int64}([])) == false)
@test(candidate([1, 2, -3, 1, 2, -3]) == false)
@test(candidate([1, 2, -4, 5, 6]) == true)
@test(candidate([1, -1, 2, -2, 5, -5, 4, -4]) == false)
@test(candidate([1, -1, 2, -2, 5, -5, 4, -5]) == true)
@test(candidate... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_40_triples_sum_to_zero | jl | """triples_sum_to_zero takes a vector of integers as an input.
it returns true if there are three distinct elements in the vector that
sum to zero, and false otherwise.
>>> triples_sum_to_zero([1, 3, 5, 0])
false
>>> triples_sum_to_zero([1, 3, -2, 1])
true
>>> triples_sum_to_zero([1, 2, 3, 7])
false
>>> triples_sum_to_... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_40_triples_sum_to_zero.py | reworded | using Test
@testset begin
candidate = triples_sum_to_zero;
@test(candidate([1, 3, 5, 0]) == false)
@test(candidate([1, 3, 5, -1]) == false)
@test(candidate([1, 3, -2, 1]) == true)
@test(candidate([1, 2, 3, 7]) == false)
@test(candidate([1, 2, 5, 7]) == false)
@test(candidate([2, 4, -5, 3, 9, 7]) == true)
@test... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_41_car_race_collision | jl | """Imagine a road that's a perfectly straight infinitely long line.
n cars are driving left to right; simultaneously, a different set of n cars
are driving right to left. The two sets of cars start out being very far from
each other. All cars move in the same speed. Two cars are said to collide
when a car that's m... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_41_car_race_collision.py | reworded | using Test
@testset begin
candidate = car_race_collision;
@test(candidate(2) == 4)
@test(candidate(3) == 9)
@test(candidate(4) == 16)
@test(candidate(8) == 64)
@test(candidate(10) == 100)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_42_incr_list | jl | """Return vector with elements incremented by 1.
>>> incr_list([1, 2, 3])
[2, 3, 4]
>>> incr_list([5, 3, 5, 2, 3, 3, 9, 0, 123])
[6, 4, 6, 3, 4, 4, 10, 1, 124]"""
function incr_list(l::Vector{Int64})::Vector{Int64}
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_42_incr_list.py | reworded | using Test
@testset begin
candidate = incr_list;
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
@test(candidate([3, 2, 1]) == [4, 3, 2])
@test(candidate([5, 2, 5, 2, 3, 3, 9, 0, 123]) == [6, 3, 6, 3, 4, 4, 10, 1, 124])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_43_pairs_sum_to_zero | jl | """pairs_sum_to_zero takes a vector of integers as an input.
it returns true if there are two distinct elements in the vector that
sum to zero, and false otherwise.
>>> pairs_sum_to_zero([1, 3, 5, 0])
false
>>> pairs_sum_to_zero([1, 3, -2, 1])
false
>>> pairs_sum_to_zero([1, 2, 3, 7])
false
>>> pairs_sum_to_zero([2, 4,... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_43_pairs_sum_to_zero.py | reworded | using Test
@testset begin
candidate = pairs_sum_to_zero;
@test(candidate([1, 3, 5, 0]) == false)
@test(candidate([1, 3, -2, 1]) == false)
@test(candidate([1, 2, 3, 7]) == false)
@test(candidate([2, 4, -5, 3, 5, 7]) == true)
@test(candidate([1]) == false)
@test(candidate([-3, 9, -1, 3, 2, 30]) == true)
@test(ca... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_44_change_base | jl | """Change numerical base of input number x to base.
return string representation after the conversion.
base numbers are less than 10.
>>> change_base(8, 3)
"22"
>>> change_base(8, 2)
"1000"
>>> change_base(7, 2)
"111""""
function change_base(x::Int64, base::Int64)::String
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_44_change_base.py | reworded | using Test
@testset begin
candidate = change_base;
@test(candidate(8, 3) == "22")
@test(candidate(9, 3) == "100")
@test(candidate(234, 2) == "11101010")
@test(candidate(16, 2) == "10000")
@test(candidate(8, 2) == "1000")
@test(candidate(7, 2) == "111")
@test(candidate(2, 3) == "2")
@test(candidate(3, 4) == "3... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_45_triangle_area | jl | """Given length of a side and high return area for a triangle.
>>> triangle_area(5, 3)
7.5"""
function triangle_area(a::Int64, h::Int64)::Float64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_45_triangle_area.py | reworded | using Test
@testset begin
candidate = triangle_area;
@test(candidate(5, 3) == 7.5)
@test(candidate(2, 2) == 2.0)
@test(candidate(10, 8) == 40.0)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_46_fib4 | jl | """The Fib4 number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fib4(0) -> 0
fib4(1) -> 0
fib4(2) -> 2
fib4(3) -> 0
fib4(n) -> fib4(n-1) + fib4(n-2) + fib4(n-3) + fib4(n-4).
Please write a function to efficiently compute the n-th element of the fib4 number sequence. Do not use r... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_46_fib4.py | reworded | using Test
@testset begin
candidate = fib4;
@test(candidate(5) == 4)
@test(candidate(8) == 28)
@test(candidate(10) == 104)
@test(candidate(12) == 386)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_47_median | jl | """Return median of elements in the vector l.
>>> median([3, 1, 2, 4, 5])
3
>>> median([-10, 4, 6, 1000, 10, 20])
15.0"""
function median(l::Vector{Int64})::Float64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_47_median.py | reworded | using Test
@testset begin
candidate = median;
@test(candidate([3, 1, 2, 4, 5]) == 3)
@test(candidate([-10, 4, 6, 1000, 10, 20]) == 8.0)
@test(candidate([5]) == 5)
@test(candidate([6, 5]) == 5.5)
@test(candidate([8, 1, 3, 9, 9, 2, 7]) == 7)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_48_is_palindrome | jl | """Checks if given string is a palindrome
>>> is_palindrome("")
true
>>> is_palindrome("aba")
true
>>> is_palindrome("aaaaa")
true
>>> is_palindrome("zbcd")
false"""
function is_palindrome(text::String)::Bool
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_48_is_palindrome.py | reworded | using Test
@testset begin
candidate = is_palindrome;
@test(candidate("") == true)
@test(candidate("aba") == true)
@test(candidate("aaaaa") == true)
@test(candidate("zbcd") == false)
@test(candidate("xywyx") == true)
@test(candidate("xywyz") == false)
@test(candidate("xywzx") == false)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_49_modp | jl | """Return 2^n modulo p (be aware of numerics).
>>> modp(3, 5)
3
>>> modp(1101, 101)
2
>>> modp(0, 101)
1
>>> modp(3, 11)
8
>>> modp(100, 101)
1"""
function modp(n::Int64, p::Int64)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_49_modp.py | reworded | using Test
@testset begin
candidate = modp;
@test(candidate(3, 5) == 3)
@test(candidate(1101, 101) == 2)
@test(candidate(0, 101) == 1)
@test(candidate(3, 11) == 8)
@test(candidate(100, 101) == 1)
@test(candidate(30, 5) == 4)
@test(candidate(31, 5) == 3)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_4_mean_absolute_deviation | jl | """ For a given vector of input numbers, calculate Mean Absolute Deviation
around the mean of this dataset.
Mean Absolute Deviation is the average absolute difference between each
element and a centerpoint (mean in this case):
MAD = average | x - x_mean |
>>> mean_absolute_deviation([1.0, 2.0, 3.0, 4.0])
1.0"""
functio... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_4_mean_absolute_deviation.py | reworded | using Test
@testset begin
candidate = mean_absolute_deviation;
@test(candidate([1.0, 2.0]) == 0.5)
@test(candidate([1.0, 2.0, 3.0, 4.0]) == 1.0)
@test(candidate([1.0, 2.0, 3.0, 4.0, 5.0]) == 1.2)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_51_remove_vowels | jl | """remove_vowels is a function that takes string and returns string without vowels.
>>> remove_vowels("")
""
>>> remove_vowels("abcdef")
"bcdf"
>>> remove_vowels("aaaaa")
""
>>> remove_vowels("aaBAA")
"B"
>>> remove_vowels("zbcd")
"zbcd""""
function remove_vowels(text::String)::String
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_51_remove_vowels.py | reworded | using Test
@testset begin
candidate = remove_vowels;
@test(candidate("") == "")
@test(candidate("abcdef
ghijklm") == "bcdf
ghjklm")
@test(candidate("fedcba") == "fdcb")
@test(candidate("eeeee") == "")
@test(candidate("acBAA") == "cB")
@test(candidate("EcBOO") == "cB")
@test(candidate("ybcd") == "ybcd")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_52_below_threshold | jl | """Return true if all numbers in the vector l are below threshold t.
>>> below_threshold([1, 2, 4, 10], 100)
true
>>> below_threshold([1, 20, 4, 10], 5)
false"""
function below_threshold(l::Vector{Int64}, t::Int64)::Bool
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_52_below_threshold.py | reworded | using Test
@testset begin
candidate = below_threshold;
@test(candidate([1, 2, 4, 10], 100) == true)
@test(candidate([1, 20, 4, 10], 5) == false)
@test(candidate([1, 20, 4, 10], 21) == true)
@test(candidate([1, 20, 4, 10], 22) == true)
@test(candidate([1, 8, 4, 10], 11) == true)
@test(candidate([1, 8, 4, 10], 10... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_53_add | jl | """Add two numbers x and y
>>> add(2, 3)
5
>>> add(5, 7)
12"""
function add(x::Int64, y::Int64)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_53_add.py | reworded | using Test
@testset begin
candidate = add;
@test(candidate(0, 1) == 1)
@test(candidate(1, 0) == 1)
@test(candidate(2, 3) == 5)
@test(candidate(5, 7) == 12)
@test(candidate(7, 5) == 12)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_54_same_chars | jl | """Check if two words have the same characters.
>>> same_chars("eabcdzzzz", "dddzzzzzzzddeddabc")
true
>>> same_chars("abcd", "dddddddabc")
true
>>> same_chars("dddddddabc", "abcd")
true
>>> same_chars("eabcd", "dddddddabc")
false
>>> same_chars("abcd", "dddddddabce")
false
>>> same_chars("eabcdzzzz", "dddzzzzzzzddddab... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_54_same_chars.py | reworded | using Test
@testset begin
candidate = same_chars;
@test(candidate("eabcdzzzz", "dddzzzzzzzddeddabc") == true)
@test(candidate("abcd", "dddddddabc") == true)
@test(candidate("dddddddabc", "abcd") == true)
@test(candidate("eabcd", "dddddddabc") == false)
@test(candidate("abcd", "dddddddabcf") == false)
@test(cand... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_55_fib | jl | """Return n-th Fibonacci number.
>>> fib(10)
55
>>> fib(1)
1
>>> fib(8)
21"""
function fib(n::Int64)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_55_fib.py | reworded | using Test
@testset begin
candidate = fib;
@test(candidate(10) == 55)
@test(candidate(1) == 1)
@test(candidate(8) == 21)
@test(candidate(11) == 89)
@test(candidate(12) == 144)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_56_correct_bracketing | jl | """ brackets is a string of "<" and ">".
return true if every opening bracket has a corresponding closing bracket.
>>> correct_bracketing("<")
false
>>> correct_bracketing("<>")
true
>>> correct_bracketing("<<><>>")
true
>>> correct_bracketing("><<>")
false"""
function correct_bracketing(brackets::String)::Bool
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_56_correct_bracketing.py | reworded | using Test
@testset begin
candidate = correct_bracketing;
@test(candidate("<>") == true)
@test(candidate("<<><>>") == true)
@test(candidate("<><><<><>><>") == true)
@test(candidate("<><><<<><><>><>><<><><<>>>") == true)
@test(candidate("<<<><>>>>") == false)
@test(candidate("><<>") == false)
@test(candidate("<... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_57_monotonic | jl | """Return true is vector elements are monotonically increasing or decreasing.
>>> monotonic([1, 2, 4, 20])
true
>>> monotonic([1, 20, 4, 10])
false
>>> monotonic([4, 1, 0, -10])
true"""
function monotonic(l::Vector{Int64})::Bool
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_57_monotonic.py | reworded | using Test
@testset begin
candidate = monotonic;
@test(candidate([1, 2, 4, 10]) == true)
@test(candidate([1, 2, 4, 20]) == true)
@test(candidate([1, 20, 4, 10]) == false)
@test(candidate([4, 1, 0, -10]) == true)
@test(candidate([4, 1, 1, 0]) == true)
@test(candidate([1, 2, 3, 2, 5, 60]) == false)
@test(candida... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_58_common | jl | """Return sorted unique common elements for two vectors.
>>> common([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121])
[1, 5, 653]
>>> common([5, 3, 2, 8], [3, 2])
[2, 3]"""
function common(l1::Vector{Int64}, l2::Vector{Int64})::Vector{Int64}
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_58_common.py | reworded | using Test
@testset begin
candidate = common;
@test(candidate([1, 4, 3, 34, 653, 2, 5], [5, 7, 1, 5, 9, 653, 121]) == [1, 5, 653])
@test(candidate([5, 3, 2, 8], [3, 2]) == [2, 3])
@test(candidate([4, 3, 2, 8], [3, 2, 4]) == [2, 3, 4])
@test(candidate([4, 3, 2, 8], Vector{Int64}([])) == Vector{Int64}([]))
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_59_largest_prime_factor | jl | """Return the largest prime factor of n. Assume n > 1 and is not a prime.
>>> largest_prime_factor(13195)
29
>>> largest_prime_factor(2048)
2"""
function largest_prime_factor(n::Int64)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_59_largest_prime_factor.py | reworded | using Test
@testset begin
candidate = largest_prime_factor;
@test(candidate(15) == 5)
@test(candidate(27) == 3)
@test(candidate(63) == 7)
@test(candidate(330) == 11)
@test(candidate(13195) == 29)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_5_intersperse | jl | """ Insert a number 'delimeter' between every two consecutive elements of input vector `numbers'
>>> intersperse([], 4)
[]
>>> intersperse([1, 2, 3], 4)
[1, 4, 2, 4, 3]"""
function intersperse(numbers::Vector{Int64}, delimeter::Int64)::Vector{Int64}
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_5_intersperse.py | reworded | using Test
@testset begin
candidate = intersperse;
@test(candidate(Vector{Int64}([]), 7) == Vector{Int64}([]))
@test(candidate([5, 6, 3, 2], 8) == [5, 8, 6, 8, 3, 8, 2])
@test(candidate([2, 2, 2], 2) == [2, 2, 2, 2, 2])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_60_sum_to_n | jl | """sum_to_n is a function that sums numbers from 1 to n.
>>> sum_to_n(30)
465
>>> sum_to_n(100)
5050
>>> sum_to_n(5)
15
>>> sum_to_n(10)
55
>>> sum_to_n(1)
1"""
function sum_to_n(n::Int64)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_60_sum_to_n.py | reworded | using Test
@testset begin
candidate = sum_to_n;
@test(candidate(1) == 1)
@test(candidate(6) == 21)
@test(candidate(11) == 66)
@test(candidate(30) == 465)
@test(candidate(100) == 5050)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_61_correct_bracketing | jl | """ brackets is a string of "(" and ")".
return true if every opening bracket has a corresponding closing bracket.
>>> correct_bracketing("(")
false
>>> correct_bracketing("()")
true
>>> correct_bracketing("(()())")
true
>>> correct_bracketing(")(()")
false"""
function correct_bracketing(brackets::String)::Bool
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_61_correct_bracketing.py | reworded | using Test
@testset begin
candidate = correct_bracketing;
@test(candidate("()") == true)
@test(candidate("(()())") == true)
@test(candidate("()()(()())()") == true)
@test(candidate("()()((()()())())(()()(()))") == true)
@test(candidate("((()())))") == false)
@test(candidate(")(()") == false)
@test(candidate("(... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_62_derivative | jl | """ xs represent coefficients of a polynomial.
xs[0] + xs[1] * x + xs[2] * x^2 + ....
Return derivative of this polynomial in the same form.
>>> derivative([3, 1, 2, 4, 5])
[1, 4, 12, 20]
>>> derivative([1, 2, 3])
[2, 6]"""
function derivative(xs::Vector{Int64})::Vector{Int64}
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_62_derivative.py | reworded | using Test
@testset begin
candidate = derivative;
@test(candidate([3, 1, 2, 4, 5]) == [1, 4, 12, 20])
@test(candidate([1, 2, 3]) == [2, 6])
@test(candidate([3, 2, 1]) == [2, 2])
@test(candidate([3, 2, 1, 0, 4]) == [2, 2, 0, 16])
@test(candidate([1]) == Vector{Int64}([]))
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_63_fibfib | jl | """The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
fibfib(0) == 0
fibfib(1) == 0
fibfib(2) == 1
fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3).
Please write a function to efficiently compute the n-th element of the fibfib number sequence.
>>> fibfib(1)
0
>>> ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_63_fibfib.py | reworded | using Test
@testset begin
candidate = fibfib;
@test(candidate(2) == 1)
@test(candidate(1) == 0)
@test(candidate(5) == 4)
@test(candidate(8) == 24)
@test(candidate(10) == 81)
@test(candidate(12) == 274)
@test(candidate(14) == 927)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_64_vowels_count | jl | """Write a function vowels_count which takes a string representing
a word as input and returns the number of vowels in the string.
Vowels in this case are 'a', 'e', 'i', 'o', 'u'. Here, 'y' is also a
vowel, but only when it is at the end of the given word.
Example:
>>> vowels_count("abcde")
2
>>> vowels_count("ACEDY")
... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_64_vowels_count.py | reworded | using Test
@testset begin
candidate = vowels_count;
@test(candidate("abcde") == 2)
@test(candidate("Alone") == 3)
@test(candidate("key") == 2)
@test(candidate("bye") == 1)
@test(candidate("keY") == 2)
@test(candidate("bYe") == 1)
@test(candidate("ACEDY") == 3)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_65_circular_shift | jl | """Circular shift the digits of the integer x, shift the digits right by shift
and return the result as a string.
If shift > number of digits, return digits reversed.
>>> circular_shift(12, 1)
"21"
>>> circular_shift(12, 2)
"12""""
function circular_shift(x::Int64, shift::Int64)::String
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_65_circular_shift.py | reworded | using Test
@testset begin
candidate = circular_shift;
@test(candidate(100, 2) == "001")
@test(candidate(12, 2) == "12")
@test(candidate(97, 8) == "79")
@test(candidate(12, 1) == "21")
@test(candidate(11, 101) == "11")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_66_digitSum | jl | """Task
Write a function that takes a string as input and returns the sum of the upper characters only'
ASCII codes.
Examples:
>>> digitSum("")
0
>>> digitSum("abAB")
131
>>> digitSum("abcCd")
67
>>> digitSum("helloE")
69
>>> digitSum("woArBld")
131
>>> digitSum("aAaaaXa")
153"""
function digitSum(s::String)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_66_digitSum.py | reworded | using Test
@testset begin
candidate = digitSum;
@test(candidate("") == 0)
@test(candidate("abAB") == 131)
@test(candidate("abcCd") == 67)
@test(candidate("helloE") == 69)
@test(candidate("woArBld") == 131)
@test(candidate("aAaaaXa") == 153)
@test(candidate(" How are yOu?") == 151)
@test(candidate("You arE Ver... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_67_fruit_distribution | jl | """In this task, you will be given a string that represents a number of apples and oranges
that are distributed in a basket of fruit this basket contains
apples, oranges, and mango fruits. Given the string that represents the total number of
the oranges and apples and an integer that represent the total number of th... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_67_fruit_distribution.py | reworded | using Test
@testset begin
candidate = fruit_distribution;
@test(candidate("5 apples and 6 oranges", 19) == 8)
@test(candidate("5 apples and 6 oranges", 21) == 10)
@test(candidate("0 apples and 1 oranges", 3) == 2)
@test(candidate("1 apples and 0 oranges", 3) == 2)
@test(candidate("2 apples and 3 oranges", 100) =... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_68_pluck | jl | """"Given a vector representing a branch of a tree that has non-negative integer nodes
your task is to pluck one of the nodes and return it.
The plucked node should be the node with the smallest even value.
If multiple nodes with the same smallest even value are found return the node that has smallest index.
The plucke... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_68_pluck.py | reworded | using Test
@testset begin
candidate = pluck;
@test(candidate([4, 2, 3]) == [2, 1])
@test(candidate([1, 2, 3]) == [2, 1])
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
@test(candidate([5, 0, 3, 0, 4, 2]) == [0, 1])
@test(candidate([1, 2, 3, 0, 5, 3]) == [0, 3])
@test(candidate([5, 4, 8, 4, 8]) == [4, ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_69_search | jl | """You are given a non-empty vector of positive integers. Return the greatest integer that is greater than
zero, and has a frequency greater than or equal to the value of the integer itself.
The frequency of an integer is the number of times it appears in the vector.
If no such a value exist, return -1.
Examples:
>>>... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_69_search.py | reworded | using Test
@testset begin
candidate = search;
@test(candidate([5, 5, 5, 5, 1]) == 1)
@test(candidate([4, 1, 4, 1, 4, 4]) == 4)
@test(candidate([3, 3]) == -1)
@test(candidate([8, 8, 8, 8, 8, 8, 8, 8]) == 8)
@test(candidate([2, 3, 3, 2, 2]) == 2)
@test(candidate([2, 7, 8, 8, 4, 8, 7, 3, 9, 6, 5, 10, 4, 3, 6, 7, 1... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_6_parse_nested_parens | jl | """ Input to this function is a string represented multiple groups for nested parentheses separated by spaces.
For each of the group, output the deepest level of nesting of parentheses.
E.g. (()()) has maximum two levels of nesting while ((())) has three.
>>> parse_nested_parens("(()()) ((())) () ((())()())")
[2, 3, 1,... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_6_parse_nested_parens.py | reworded | using Test
@testset begin
candidate = parse_nested_parens;
@test(candidate("(()()) ((())) () ((())()())") == [2, 3, 1, 3])
@test(candidate("() (()) ((())) (((())))") == [1, 2, 3, 4])
@test(candidate("(()(())((())))") == [4])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_70_strange_sort_list | jl | """Given vector of integers, return vector in strange order.
Strange sorting, is when you start with the minimum value,
then maximum of the remaining integers, then minimum and so on.
Examples:
>>> strange_sort_list([1, 2, 3, 4])
[1, 4, 2, 3]
>>> strange_sort_list([5, 5, 5, 5])
[5, 5, 5, 5]
>>> strange_sort_list([])
[]... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_70_strange_sort_list.py | reworded | using Test
@testset begin
candidate = strange_sort_list;
@test(candidate([1, 2, 3, 4]) == [1, 4, 2, 3])
@test(candidate([5, 6, 7, 8, 9]) == [5, 9, 6, 8, 7])
@test(candidate([1, 2, 3, 4, 5]) == [1, 5, 2, 4, 3])
@test(candidate([5, 6, 7, 8, 9, 1]) == [1, 9, 5, 8, 6, 7])
@test(candidate([5, 5, 5, 5]) == [5, 5, 5, 5... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_71_triangle_area | jl | """Given the lengths of the three sides of a triangle. Return the area of
the triangle rounded to 2 decimal points if the three sides form a valid triangle.
Otherwise return -1
Three sides make a valid triangle when the sum of any two sides is greater
than the third side.
Example:
>>> triangle_area(3, 4, 5)
6.0
>>> t... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_71_triangle_area.py | reworded | using Test
@testset begin
candidate = triangle_area;
@test(candidate(3, 4, 5) == 6.0)
@test(candidate(1, 2, 10) == -1)
@test(candidate(4, 8, 5) == 8.18)
@test(candidate(2, 2, 2) == 1.73)
@test(candidate(1, 2, 3) == -1)
@test(candidate(10, 5, 7) == 16.25)
@test(candidate(2, 6, 3) == -1)
@test(candidate(1, 1, 1... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_72_will_it_fly | jl | """Write a function that returns true if the object q will fly, and false otherwise.
The object q will fly if it's balanced (it is a palindromic vector) and the sum of its elements is less than or equal the maximum possible weight w.
Example:
>>> will_it_fly([1, 2], 5)
false
# 1+2 is less than the maximum possible weig... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_72_will_it_fly.py | reworded | using Test
@testset begin
candidate = will_it_fly;
@test(candidate([3, 2, 3], 9) == true)
@test(candidate([1, 2], 5) == false)
@test(candidate([3], 5) == true)
@test(candidate([3, 2, 3], 1) == false)
@test(candidate([1, 2, 3], 6) == false)
@test(candidate([5], 5) == true)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_73_smallest_change | jl | """Given a vector arr of integers, find the minimum number of elements that
need to be changed to make the vector palindromic. A palindromic vector is a vector that
is read the same backwards and forwards. In one change, you can change one element to any other element.
For example:
>>> smallest_change([1, 2, 3, 5, 4, 7... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_73_smallest_change.py | reworded | using Test
@testset begin
candidate = smallest_change;
@test(candidate([1, 2, 3, 5, 4, 7, 9, 6]) == 4)
@test(candidate([1, 2, 3, 4, 3, 2, 2]) == 1)
@test(candidate([1, 4, 2]) == 1)
@test(candidate([1, 4, 4, 2]) == 1)
@test(candidate([1, 2, 3, 2, 1]) == 0)
@test(candidate([3, 1, 1, 3]) == 0)
@test(candidate([1]... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_74_total_match | jl | """Write a function that accepts two vectors of strings and returns the vector that has
total number of chars in the all strings of the vector less than the other vector.
if the two vectors have the same number of chars, return the first vector.
Examples
>>> total_match([], [])
[]
>>> total_match(["hi", "admin"], ["hI... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_74_total_match.py | reworded | using Test
@testset begin
candidate = total_match;
@test(candidate(Vector{String}([]), Vector{String}([])) == Vector{String}([]))
@test(candidate(["hi", "admin"], ["hi", "hi"]) == ["hi", "hi"])
@test(candidate(["hi", "admin"], ["hi", "hi", "admin", "project"]) == ["hi", "admin"])
@test(candidate(["4"], ["1", "2",... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_75_is_multiply_prime | jl | """Write a function that returns true if the given number is the multiplication of 3 prime numbers
and false otherwise.
Knowing that (a) is less then 100.
Example:
>>> is_multiply_prime(30)
true
30 = 2 * 3 * 5"""
function is_multiply_prime(a::Int64)::Bool
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_75_is_multiply_prime.py | reworded | using Test
@testset begin
candidate = is_multiply_prime;
@test(candidate(5) == false)
@test(candidate(30) == true)
@test(candidate(8) == true)
@test(candidate(10) == false)
@test(candidate(125) == true)
@test(candidate(105) == true)
@test(candidate(126) == false)
@test(candidate(729) == false)
@test(candidat... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_76_is_simple_power | jl | """Your task is to write a function that returns true if a number x is a simple
power of n and false in other cases.
x is a simple power of n if n**int=x
For example:
>>> is_simple_power(1, 4)
true
>>> is_simple_power(2, 2)
true
>>> is_simple_power(8, 2)
true
>>> is_simple_power(3, 2)
false
>>> is_simple_power(3, 1)
fa... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_76_is_simple_power.py | reworded | using Test
@testset begin
candidate = is_simple_power;
@test(candidate(16, 2) == true)
@test(candidate(143214, 16) == false)
@test(candidate(4, 2) == true)
@test(candidate(9, 3) == true)
@test(candidate(16, 4) == true)
@test(candidate(24, 2) == false)
@test(candidate(128, 4) == false)
@test(candidate(12, 6) =... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_77_iscube | jl | """Write a function that takes an integer a and returns true
if this ingeger is a cube of some integer number.
Note: you may assume the input is always valid.
Examples:
>>> iscube(1)
true
>>> iscube(2)
false
>>> iscube(-1)
true
>>> iscube(64)
true
>>> iscube(0)
true
>>> iscube(180)
false"""
function iscube(a::Int64)::... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_77_iscube.py | reworded | using Test
@testset begin
candidate = iscube;
@test(candidate(1) == true)
@test(candidate(2) == false)
@test(candidate(-1) == true)
@test(candidate(64) == true)
@test(candidate(180) == false)
@test(candidate(1000) == true)
@test(candidate(0) == true)
@test(candidate(1729) == false)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_78_hex_key | jl | """You have been tasked to write a function that receives
a hexadecimal number as a string and counts the number of hexadecimal
digits that are primes (prime number, or a prime, is a natural number
greater than 1 that is not a product of two smaller natural numbers).
Hexadecimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8,... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_78_hex_key.py | reworded | using Test
@testset begin
candidate = hex_key;
@test(candidate("AB") == 1)
@test(candidate("1077E") == 2)
@test(candidate("ABED1A33") == 4)
@test(candidate("2020") == 2)
@test(candidate("123456789ABCDEF0") == 6)
@test(candidate("112233445566778899AABBCCDDEEFF00") == 12)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_79_decimal_to_binary | jl | """You will be given a number in decimal form and your task is to convert it to
binary format. The function should return a string, with each character representing a binary
number. Each character in the string will be '0' or '1'.
There will be an extra couple of characters 'db' at the beginning and at the end of the s... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_79_decimal_to_binary.py | reworded | using Test
@testset begin
candidate = decimal_to_binary;
@test(candidate(0) == "db0db")
@test(candidate(32) == "db100000db")
@test(candidate(103) == "db1100111db")
@test(candidate(15) == "db1111db")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_7_filter_by_substring | jl | """ Filter an input vector of strings only for ones that contain given substring
>>> filter_by_substring([], "a")
[]
>>> filter_by_substring(["abc", "bacd", "cde", "array"], "a")
["abc", "bacd", "array"]"""
function filter_by_substring(strings::Vector{String}, substring::String)::Vector{String}
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_7_filter_by_substring.py | reworded | using Test
@testset begin
candidate = filter_by_substring;
@test(candidate(Vector{String}([]), "john") == Vector{String}([]))
@test(candidate(["xxx", "asd", "xxy", "john doe", "xxxAAA", "xxx"], "xxx") == ["xxx", "xxxAAA", "xxx"])
@test(candidate(["xxx", "asd", "aaaxxy", "john doe", "xxxAAA", "xxx"], "xx") == ["xxx... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_80_is_happy | jl | """You are given a string s.
Your task is to check if the string is hapjl or not.
A string is hapjl if its length is at least 3 and every 3 consecutive letters are distinct
For example:
>>> is_happy("a")
false
>>> is_happy("aa")
false
>>> is_happy("abcd")
true
>>> is_happy("aabb")
false
>>> is_happy("adb")
true
>>> is_... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_80_is_happy.py | reworded | using Test
@testset begin
candidate = is_happy;
@test(candidate("a") == false)
@test(candidate("aa") == false)
@test(candidate("abcd") == true)
@test(candidate("aabb") == false)
@test(candidate("adb") == true)
@test(candidate("xyy") == false)
@test(candidate("iopaxpoi") == true)
@test(candidate("iopaxioi") ==... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_81_numerical_letter_grade | jl | """It is the last week of the semester and the teacher has to give the grades
to students. The teacher has been making her own algorithm for grading.
The only problem is, she has lost the code she used for grading.
She has given you a vector of GPAs for some students and you have to write
a function that can output a ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_81_numerical_letter_grade.py | reworded | using Test
@testset begin
candidate = numerical_letter_grade;
@test(candidate([4.0, 3, 1.7, 2, 3.5]) == ["A+", "B", "C-", "C", "A-"])
@test(candidate([1.2]) == ["D+"])
@test(candidate([0.5]) == ["D-"])
@test(candidate([0.0]) == ["E"])
@test(candidate([1.0, 0.3, 1.5, 2.8, 3.3]) == ["D", "D-", "C-", "B", "B+"])
@... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_82_prime_length | jl | """Write a function that takes a string and returns true if the string
length is a prime number or false otherwise
Examples
>>> prime_length("Hello")
true
>>> prime_length("abcdcba")
true
>>> prime_length("kittens")
true
>>> prime_length("orange")
false"""
function prime_length(string::String)::Bool
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_82_prime_length.py | reworded | using Test
@testset begin
candidate = prime_length;
@test(candidate("Hello") == true)
@test(candidate("abcdcba") == true)
@test(candidate("kittens") == true)
@test(candidate("orange") == false)
@test(candidate("wow") == true)
@test(candidate("world") == true)
@test(candidate("MadaM") == true)
@test(candidate(... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_83_starts_one_ends | jl | """Given a positive integer n, return the count of the numbers of n-digit
positive integers that start or end with 1."""
function starts_one_ends(n::Int64)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_83_starts_one_ends.py | reworded | using Test
@testset begin
candidate = starts_one_ends;
@test(candidate(1) == 1)
@test(candidate(2) == 18)
@test(candidate(3) == 180)
@test(candidate(4) == 1800)
@test(candidate(5) == 18000)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_84_solve | jl | """Given a positive integer N, return the total sum of its digits in binary.
Example
>>> solve(1000)
"1"
>>> solve(150)
"110"
>>> solve(147)
"1100"
Variables:
@N integer
Constraints: 0 ≤ N ≤ 10000.
Output:
a string of binary number"""
function solve(N::Int64)::String
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_84_solve.py | reworded | using Test
@testset begin
candidate = solve;
@test(candidate(1000) == "1")
@test(candidate(150) == "110")
@test(candidate(147) == "1100")
@test(candidate(333) == "1001")
@test(candidate(963) == "10010")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_85_add | jl | """Given a non-empty vector of integers lst. add the even elements that are at odd indices..
Examples:
>>> add([4, 2, 6, 7])
2"""
function add(lst::Vector{Int64})::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_85_add.py | reworded | using Test
@testset begin
candidate = add;
@test(candidate([4, 88]) == 88)
@test(candidate([4, 5, 6, 7, 2, 122]) == 122)
@test(candidate([4, 0, 6, 7]) == 0)
@test(candidate([4, 4, 6, 8]) == 12)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_86_anti_shuffle | jl | """Write a function that takes a string and returns an ordered version of it.
Ordered version of string, is a string where all words (separated by space)
are replaced by a new word where all the characters arranged in
ascending order based on ascii value.
Note: You should keep the order of words and blank spaces in the... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_86_anti_shuffle.py | reworded | using Test
@testset begin
candidate = anti_shuffle;
@test(candidate("Hi") == "Hi")
@test(candidate("hello") == "ehllo")
@test(candidate("number") == "bemnru")
@test(candidate("abcd") == "abcd")
@test(candidate("Hello World!!!") == "Hello !!!Wdlor")
@test(candidate("") == "")
@test(candidate("Hi. My name is Mis... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_87_get_row | jl | """You are given a 2 dimensional data, as a nested vectors,
which is similar to matrix, however, unlike matrices,
each row may contain a different number of columns.
Given lst, and integer x, find integers x in the vector,
and return vector of tuples, [(x1, y1), (x2, y2) ...] such that
each tuple is a coordinate - (row... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_87_get_row.py | reworded | using Test
@testset begin
candidate = get_row;
@test(candidate([[1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 1, 6], [1, 2, 3, 4, 5, 1]], 1) == [(0, 0), (1, 4), (1, 0), (2, 5), (2, 0)])
@test(candidate([[1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 5, 6], [1, 2, 3, 4, 5, 6]], 2) ==... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_88_sort_array | jl | """Given a vector of non-negative integers, return a cojl of the given vector after sorting,
you will sort the given vector in ascending order if the sum( first index value, last index value) is odd,
or sort it in descending order if the sum( first index value, last index value) is even.
Note:
* don't change the given ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_88_sort_array.py | reworded | using Test
@testset begin
candidate = sort_array;
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
@test(candidate([5]) == [5])
@test(candidate([2, 4, 3, 0, 1, 5]) == [0, 1, 2, 3, 4, 5])
@test(candidate([2, 4, 3, 0, 1, 5, 6]) == [6, 5, 4, 3, 2, 1, 0])
@test(candidate([2, 1]) == [1, 2])
@test(candidate([... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_89_encrypt | jl | """Create a function encrypt that takes a string as an argument and
returns a string encrypted with the alphabet being rotated.
The alphabet should be rotated in a manner such that the letters
shift down by two multiplied to two places.
For example:
>>> encrypt("hi")
"lm"
>>> encrypt("asdfghjkl")
"ewhjklnop"
>>> encr... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_89_encrypt.py | reworded | using Test
@testset begin
candidate = encrypt;
@test(candidate("hi") == "lm")
@test(candidate("asdfghjkl") == "ewhjklnop")
@test(candidate("gf") == "kj")
@test(candidate("et") == "ix")
@test(candidate("faewfawefaewg") == "jeiajeaijeiak")
@test(candidate("hellomyfriend") == "lippsqcjvmirh")
@test(candidate("dxz... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_8_sum_product | jl | """ For a given vector of integers, return a tuple consisting of a sum and a product of all the integers in a vector.
Empty sum should be equal to 0 and empty product should be equal to 1.
>>> sum_product([])
(0, 1)
>>> sum_product([1, 2, 3, 4])
(10, 24)"""
function sum_product(numbers::Vector{Int64})::Tuple{Int64, Int... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_8_sum_product.py | reworded | using Test
@testset begin
candidate = sum_product;
@test(candidate(Vector{Int64}([])) == (0, 1))
@test(candidate([1, 1, 1]) == (3, 1))
@test(candidate([100, 0]) == (100, 0))
@test(candidate([3, 5, 7]) == (15, 105))
@test(candidate([10]) == (10, 10))
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_90_next_smallest | jl | """You are given a vector of integers.
Write a function next_smallest() that returns the 2nd smallest element of the vector.
Return nothing if there is no such element.
>>> next_smallest([1, 2, 3, 4, 5])
2
>>> next_smallest([5, 1, 4, 3, 2])
2
>>> next_smallest([])
nothing
>>> next_smallest([1, 1])
nothing"""
function n... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_90_next_smallest.py | reworded | using Test
@testset begin
candidate = next_smallest;
@test(candidate([1, 2, 3, 4, 5]) == 2)
@test(candidate([5, 1, 4, 3, 2]) == 2)
@test(candidate(Vector{Int64}([])) == nothing)
@test(candidate([1, 1]) == nothing)
@test(candidate([1, 1, 1, 1, 0]) == 1)
@test(candidate([1, 1]) == nothing)
@test(candidate([-35, ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_91_is_bored | jl | """You'll be given a string of words, and your task is to count the number
of boredoms. A boredom is a sentence that starts with the word "I".
Sentences are delimited by '.', '?' or '!'.
For example:
>>> is_bored("Hello world")
0
>>> is_bored("The sky is blue. The sun is shining. I love this weather")
1"""
function is_... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_91_is_bored.py | reworded | using Test
@testset begin
candidate = is_bored;
@test(candidate("Hello world") == 0)
@test(candidate("Is the sky blue?") == 0)
@test(candidate("I love It !") == 1)
@test(candidate("bIt") == 0)
@test(candidate("I feel good today. I will be productive. will kill It") == 2)
@test(candidate("You and I are going for... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_92_any_int | jl | """Create a function that takes 3 numbers.
Returns true if one of the numbers is equal to the sum of the other two, and all numbers are integers.
Returns false in any other cases.
Examples
>>> any_int(5, 2, 7)
true
>>> any_int(3, 2, 2)
false
>>> any_int(3, -2, 1)
true
>>> any_int(3.6, -2.2, 2)
false"""
function any_int... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_92_any_int.py | reworded | using Test
@testset begin
candidate = any_int;
@test(candidate(2, 3, 1) == true)
@test(candidate(2.5, 2, 3) == false)
@test(candidate(1.5, 5, 3.5) == false)
@test(candidate(2, 6, 2) == false)
@test(candidate(4, 2, 2) == true)
@test(candidate(2.2, 2.2, 2.2) == false)
@test(candidate(-4, 6, 2) == true)
@test(ca... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_93_encode | jl | """Write a function that takes a message, and encodes in such a
way that it swaps case of all letters, replaces all vowels in
the message with the letter that appears 2 places ahead of that
vowel in the english alphabet.
Assume only letters.
Examples:
>>> encode("test")
"TGST"
>>> encode("This is a message")
"tHKS... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_93_encode.py | reworded | using Test
@testset begin
candidate = encode;
@test(candidate("TEST") == "tgst")
@test(candidate("Mudasir") == "mWDCSKR")
@test(candidate("YES") == "ygs")
@test(candidate("This is a message") == "tHKS KS C MGSSCGG")
@test(candidate("I DoNt KnOw WhAt tO WrItE") == "k dQnT kNqW wHcT Tq wRkTg")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_94_skjkasdkd | jl | """You are given a vector of integers.
You need to find the largest prime value and return the sum of its digits.
Examples:
>>> skjkasdkd([0, 3, 2, 1, 3, 5, 7, 4, 5, 5, 5, 2, 181, 32, 4, 32, 3, 2, 32, 324, 4, 3])
10
>>> skjkasdkd([1, 0, 1, 8, 2, 4597, 2, 1, 3, 40, 1, 2, 1, 2, 4, 2, 5, 1])
25
>>> skjkasdkd([1, 3, 1, 32,... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_94_skjkasdkd.py | reworded | using Test
@testset begin
candidate = skjkasdkd;
@test(candidate([0, 3, 2, 1, 3, 5, 7, 4, 5, 5, 5, 2, 181, 32, 4, 32, 3, 2, 32, 324, 4, 3]) == 10)
@test(candidate([1, 0, 1, 8, 2, 4597, 2, 1, 3, 40, 1, 2, 1, 2, 4, 2, 5, 1]) == 25)
@test(candidate([1, 3, 1, 32, 5107, 34, 83278, 109, 163, 23, 2323, 32, 30, 1, 9, 3]) ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_95_check_dict_case | jl | """Given a dictionary, return true if all keys are strings in lower
case or all keys are strings in upper case, else return false.
The function should return false is the given dictionary is empty.
Examples:
>>> check_dict_case(Dict("a" => "apple", "b" => "banana"))
true
>>> check_dict_case(Dict("a" => "apple", "A" =>... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_95_check_dict_case.py | reworded | using Test
@testset begin
candidate = check_dict_case;
@test(candidate(Dict("p" => "pineapple", "b" => "banana")) == true)
@test(candidate(Dict("p" => "pineapple", "A" => "banana", "B" => "banana")) == false)
@test(candidate(Dict("p" => "pineapple", "5" => "banana", "a" => "apple")) == false)
@test(candidate(Dict... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_96_count_up_to | jl | """Implement a function that takes an non-negative integer and returns a vector of the first n
integers that are prime numbers and less than n.
for example:
>>> count_up_to(5)
[2, 3]
>>> count_up_to(11)
[2, 3, 5, 7]
>>> count_up_to(0)
[]
>>> count_up_to(20)
[2, 3, 5, 7, 11, 13, 17, 19]
>>> count_up_to(1)
[]
>>> count_u... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_96_count_up_to.py | reworded | using Test
@testset begin
candidate = count_up_to;
@test(candidate(5) == [2, 3])
@test(candidate(6) == [2, 3, 5])
@test(candidate(7) == [2, 3, 5])
@test(candidate(10) == [2, 3, 5, 7])
@test(candidate(0) == Vector{Int64}([]))
@test(candidate(22) == [2, 3, 5, 7, 11, 13, 17, 19])
@test(candidate(1) == Vector{Int6... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_97_multiply | jl | """Complete the function that takes two integers and returns
the product of their unit digits.
Assume the input is always valid.
Examples:
>>> multiply(148, 412)
16
>>> multiply(19, 28)
72
>>> multiply(2020, 1851)
0
>>> multiply(14, -15)
20"""
function multiply(a::Int64, b::Int64)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_97_multiply.py | reworded | using Test
@testset begin
candidate = multiply;
@test(candidate(148, 412) == 16)
@test(candidate(19, 28) == 72)
@test(candidate(2020, 1851) == 0)
@test(candidate(14, -15) == 20)
@test(candidate(76, 67) == 42)
@test(candidate(17, 27) == 49)
@test(candidate(0, 1) == 0)
@test(candidate(0, 0) == 0)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_98_count_upper | jl | """Given a string s, count the number of uppercase vowels in even indices.
For example:
>>> count_upper("aBCdEf")
1
>>> count_upper("abcdefg")
0
>>> count_upper("dBBE")
0"""
function count_upper(s::String)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_98_count_upper.py | reworded | using Test
@testset begin
candidate = count_upper;
@test(candidate("aBCdEf") == 1)
@test(candidate("abcdefg") == 0)
@test(candidate("dBBE") == 0)
@test(candidate("B") == 0)
@test(candidate("U") == 1)
@test(candidate("") == 0)
@test(candidate("EEEE") == 2)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_99_closest_integer | jl | """Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
Examples
>>> closest_integer("10")
10
>>> closest_integer("15.3")
15
Note:
Rounding away from zero means that if the given number is equi... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_99_closest_integer.py | reworded | using Test
@testset begin
candidate = closest_integer;
@test(candidate("10") == 10)
@test(candidate("14.5") == 15)
@test(candidate("-15.5") == -16)
@test(candidate("15.3") == 15)
@test(candidate("0") == 0)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_9_rolling_max | jl | """ From a given vector of integers, generate a vector of rolling maximum element found until given moment
in the sequence.
>>> rolling_max([1, 2, 3, 2, 3, 4, 2])
[1, 2, 3, 3, 3, 4, 4]"""
function rolling_max(numbers::Vector{Int64})::Vector{Int64}
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_9_rolling_max.py | reworded | using Test
@testset begin
candidate = rolling_max;
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
@test(candidate([1, 2, 3, 4]) == [1, 2, 3, 4])
@test(candidate([4, 3, 2, 1]) == [4, 4, 4, 4])
@test(candidate([3, 2, 3, 100, 3]) == [3, 3, 3, 100, 100])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_0_has_close_elements | jl | """ Check if in given list of numbers, are any two numbers closer to each other than
given threshold.
>>> has_close_elements([1.0, 2.0, 3.0], 0.5)
false
>>> has_close_elements([1.0, 2.8, 3.0, 4.0, 5.0, 2.0], 0.3)
true"""
function has_close_elements(numbers::Vector{Float64}, threshold::Float64)::Bool
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_0_has_close_elements.py | verbatim | using Test
@testset begin
candidate = has_close_elements;
@test(candidate([1.0, 2.0, 3.9, 4.0, 5.0, 2.2], 0.3) == true)
@test(candidate([1.0, 2.0, 3.9, 4.0, 5.0, 2.2], 0.05) == false)
@test(candidate([1.0, 2.0, 5.9, 4.0, 5.0], 0.95) == true)
@test(candidate([1.0, 2.0, 5.9, 4.0, 5.0], 0.8) == false)
@test(candida... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_100_make_a_pile | jl | """Given a positive integer n, you have to make a pile of n levels of stones.
The first level has n stones.
The number of stones in the next level is:
- the next odd number if n is odd.
- the next even number if n is even.
Return the number of stones in each level in a list, where element at index
i represents ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_100_make_a_pile.py | verbatim | using Test
@testset begin
candidate = make_a_pile;
@test(candidate(3) == [3, 5, 7])
@test(candidate(4) == [4, 6, 8, 10])
@test(candidate(5) == [5, 7, 9, 11, 13])
@test(candidate(6) == [6, 8, 10, 12, 14, 16])
@test(candidate(8) == [8, 10, 12, 14, 16, 18, 20, 22])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_101_words_string | jl | """You will be given a string of words separated by commas or spaces. Your task is
to split the string into words and return an array of the words.
For example:
>>> words_string("Hi, my name is John")
["Hi", "my", "name", "is", "John"]
>>> words_string("One, two, three, four, five, six")
["One", "two", "three", "four",... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_101_words_string.py | verbatim | using Test
@testset begin
candidate = words_string;
@test(candidate("Hi, my name is John") == ["Hi", "my", "name", "is", "John"])
@test(candidate("One, two, three, four, five, six") == ["One", "two", "three", "four", "five", "six"])
@test(candidate("Hi, my name") == ["Hi", "my", "name"])
@test(candidate("One,, tw... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_102_choose_num | jl | """This function takes two positive numbers x and y and returns the
biggest even integer number that is in the range [x, y] inclusive. If
there's no such number, then the function should return -1.
For example:
>>> choose_num(12, 15)
14
>>> choose_num(13, 12)
-1"""
function choose_num(x::Int64, y::Int64)::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_102_choose_num.py | verbatim | using Test
@testset begin
candidate = choose_num;
@test(candidate(12, 15) == 14)
@test(candidate(13, 12) == -1)
@test(candidate(33, 12354) == 12354)
@test(candidate(5234, 5233) == -1)
@test(candidate(6, 29) == 28)
@test(candidate(27, 10) == -1)
@test(candidate(7, 7) == -1)
@test(candidate(546, 546) == 546)
en... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_103_rounded_avg | jl | """You are given two positive integers n and m, and your task is to compute the
average of the integers from n through m (including n and m).
Round the answer to the nearest integer and convert that to binary.
If n is greater than m, return -1.
Example:
>>> rounded_avg(1, 5)
"0b11"
>>> rounded_avg(7, 5)
-1
>>> rounded... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_103_rounded_avg.py | verbatim | using Test
@testset begin
candidate = rounded_avg;
@test(candidate(1, 5) == "0b11")
@test(candidate(7, 13) == "0b1010")
@test(candidate(964, 977) == "0b1111001010")
@test(candidate(996, 997) == "0b1111100100")
@test(candidate(560, 851) == "0b1011000010")
@test(candidate(185, 546) == "0b101101110")
@test(candid... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_104_unique_digits | jl | """Given a list of positive integers x. return a sorted list of all
elements that hasn't any even digit.
Note: Returned list should be sorted in increasing order.
For example:
>>> unique_digits([15, 33, 1422, 1])
[1, 15, 33]
>>> unique_digits([152, 323, 1422, 10])
[]"""
function unique_digits(x::Vector{Int64})::Vector... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_104_unique_digits.py | verbatim | using Test
@testset begin
candidate = unique_digits;
@test(candidate([15, 33, 1422, 1]) == [1, 15, 33])
@test(candidate([152, 323, 1422, 10]) == Vector{Int64}([]))
@test(candidate([12345, 2033, 111, 151]) == [111, 151])
@test(candidate([135, 103, 31]) == [31, 135])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_105_by_length | jl | """Given an array of integers, sort the integers that are between 1 and 9 inclusive,
reverse the resulting array, and then replace each digit by its corresponding name from
"One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine".
For example:
>>> by_length([2, 1, 1, 4, 5, 8, 2, 3])
["Eight", "Five", "Fou... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_105_by_length.py | verbatim | using Test
@testset begin
candidate = by_length;
@test(candidate([2, 1, 1, 4, 5, 8, 2, 3]) == ["Eight", "Five", "Four", "Three", "Two", "Two", "One", "One"])
@test(candidate(Vector{Int64}([])) == Vector{String}([]))
@test(candidate([1, -1, 55]) == ["One"])
@test(candidate([1, -1, 3, 2]) == ["Three", "Two", "One"]... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_106_f | jl | """ Implement the function f that takes n as a parameter,
and returns a list of size n, such that the value of the element at index i is the factorial of i if i is even
or the sum of numbers from 1 to i otherwise.
i starts from 1.
the factorial of i is the multiplication of the numbers from 1 to i (1 * 2 * ... * i).
Ex... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_106_f.py | verbatim | using Test
@testset begin
candidate = f;
@test(candidate(5) == [1, 2, 6, 24, 15])
@test(candidate(7) == [1, 2, 6, 24, 15, 720, 28])
@test(candidate(1) == [1])
@test(candidate(3) == [1, 2, 6])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_107_even_odd_palindrome | jl | """Given a positive integer n, return a tuple that has the number of even and odd
integer palindromes that fall within the range(1, n), inclusive.
Example 1:
>>> even_odd_palindrome(3)
(1, 2)
Explanation:
Integer palindrome are 1, 2, 3. one of them is even, and two of them are odd.
Example 2:
>>> even_odd_palin... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_107_even_odd_palindrome.py | verbatim | using Test
@testset begin
candidate = even_odd_palindrome;
@test(candidate(123) == (8, 13))
@test(candidate(12) == (4, 6))
@test(candidate(3) == (1, 2))
@test(candidate(63) == (6, 8))
@test(candidate(25) == (5, 6))
@test(candidate(19) == (4, 6))
@test(candidate(9) == (4, 5))
@test(candidate(1) == (0, 1))
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_108_count_nums | jl | """Write a function count_nums which takes an array of integers and returns
the number of elements which has a sum of digits > 0.
If a number is negative, then its first signed digit will be negative:
e.g. -123 has signed digits -1, 2, and 3.
>>> count_nums([])
0
>>> count_nums([-1, 11, -11])
1
>>> count_nums([1, 1, 2]... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_108_count_nums.py | verbatim | using Test
@testset begin
candidate = count_nums;
@test(candidate(Vector{Int64}([])) == 0)
@test(candidate([-1, -2, 0]) == 0)
@test(candidate([1, 1, 2, -2, 3, 4, 5]) == 6)
@test(candidate([1, 6, 9, -6, 0, 1, 5]) == 5)
@test(candidate([1, 100, 98, -7, 1, -1]) == 4)
@test(candidate([12, 23, 34, -45, -56, 0]) == 5... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_109_move_one_ball | jl | """We have an array 'arr' of N integers arr[1], arr[2], ..., arr[N].The
numbers in the array will be randomly ordered. Your task is to determine if
it is possible to get an array sorted in non-decreasing order by performing
the following operation on the given array:
You are allowed to perform right shift operatio... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_109_move_one_ball.py | verbatim | using Test
@testset begin
candidate = move_one_ball;
@test(candidate([3, 4, 5, 1, 2]) == true)
@test(candidate([3, 5, 10, 1, 2]) == true)
@test(candidate([4, 3, 1, 2]) == false)
@test(candidate([3, 5, 4, 1, 2]) == false)
@test(candidate(Vector{Int64}([])) == true)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_10_make_palindrome | jl | """ Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
>>> make_palindrome("")
""
>>> make_palindrome("cat")
... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_10_make_palindrome.py | verbatim | using Test
@testset begin
candidate = make_palindrome;
@test(candidate("") == "")
@test(candidate("x") == "x")
@test(candidate("xyz") == "xyzyx")
@test(candidate("xyx") == "xyx")
@test(candidate("jerry") == "jerryrrej")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_110_exchange | jl | """In this problem, you will implement a function that takes two lists of numbers,
and determines whether it is possible to perform an exchange of elements
between them to make lst1 a list of only even numbers.
There is no limit on the number of exchanged elements between lst1 and lst2.
If it is possible to exchange el... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_110_exchange.py | verbatim | using Test
@testset begin
candidate = exchange;
@test(candidate([1, 2, 3, 4], [1, 2, 3, 4]) == "YES")
@test(candidate([1, 2, 3, 4], [1, 5, 3, 4]) == "NO")
@test(candidate([1, 2, 3, 4], [2, 1, 4, 3]) == "YES")
@test(candidate([5, 7, 3], [2, 6, 4]) == "YES")
@test(candidate([5, 7, 3], [2, 6, 3]) == "NO")
@test(ca... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_111_histogram | jl | """Given a string representing a space separated lowercase letters, return a dictionary
of the letter with the most repetition and containing the corresponding count.
If several letters have the same occurrence, return all of them.
Example:
>>> histogram("a b c")
Dict("a" => 1, "b" => 1, "c" => 1)
>>> histogram("a b b ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_111_histogram.py | verbatim | using Test
@testset begin
candidate = histogram;
@test(candidate("a b b a") == Dict("a" => 2, "b" => 2))
@test(candidate("a b c a b") == Dict("a" => 2, "b" => 2))
@test(candidate("a b c d g") == Dict("a" => 1, "b" => 1, "c" => 1, "d" => 1, "g" => 1))
@test(candidate("r t g") == Dict("r" => 1, "t" => 1, "g" => 1))... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_112_reverse_delete | jl | """Task
We are given two strings s and c, you have to deleted all the characters in s that are equal to any character in c
then check if the result string is palindrome.
A string is called palindrome if it reads the same backward as forward.
You should return a tuple containing the result string and True/False for the ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_112_reverse_delete.py | verbatim | using Test
@testset begin
candidate = reverse_delete;
@test(candidate("abcde", "ae") == ("bcd", false))
@test(candidate("abcdef", "b") == ("acdef", false))
@test(candidate("abcdedcba", "ab") == ("cdedc", true))
@test(candidate("dwik", "w") == ("dik", false))
@test(candidate("a", "a") == ("", true))
@test(candid... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_113_odd_count | jl | """Given a list of strings, where each string consists of only digits, return a list.
Each element i of the output should be "the number of odd elements in the
string i of the input." where all the i's should be replaced by the number
of odd digits in the i'th string of the input.
>>> odd_count(["1234567"])
["the numbe... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_113_odd_count.py | verbatim | using Test
@testset begin
candidate = odd_count;
@test(candidate(["1234567"]) == ["the number of odd elements 4n the str4ng 4 of the 4nput."])
@test(candidate(["3", "11111111"]) == ["the number of odd elements 1n the str1ng 1 of the 1nput.", "the number of odd elements 8n the str8ng 8 of the 8nput."])
@test(candid... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_114_minSubArraySum | jl | """Given an array of integers nums, find the minimum sum of any non-empty sub-array
of nums.
Example
>>> minSubArraySum([2, 3, 4, 1, 2, 4])
1
>>> minSubArraySum([-1, -2, -3])
-6"""
function minSubArraySum(nums::Vector{Int64})::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_114_minSubArraySum.py | verbatim | using Test
@testset begin
candidate = minSubArraySum;
@test(candidate([2, 3, 4, 1, 2, 4]) == 1)
@test(candidate([-1, -2, -3]) == -6)
@test(candidate([-1, -2, -3, 2, -10]) == -14)
@test(candidate([-9999999999999999]) == -9999999999999999)
@test(candidate([0, 10, 20, 1000000]) == 0)
@test(candidate([-1, -2, -3, 1... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_115_max_fill | jl | """You are given a rectangular grid of wells. Each row represents a single well,
and each 1 in a row represents a single unit of water.
Each well has a corresponding bucket that can be used to extract water from it,
and all buckets have the same capacity.
Your task is to use the buckets to empty the wells.
Output the ... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_115_max_fill.py | verbatim | using Test
@testset begin
candidate = max_fill;
@test(candidate([[0, 0, 1, 0], [0, 1, 0, 0], [1, 1, 1, 1]], 1) == 6)
@test(candidate([[0, 0, 1, 1], [0, 0, 0, 0], [1, 1, 1, 1], [0, 1, 1, 1]], 2) == 5)
@test(candidate([[0, 0, 0], [0, 0, 0]], 5) == 0)
@test(candidate([[1, 1, 1, 1], [1, 1, 1, 1]], 2) == 4)
@test(can... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_116_sort_array | jl | """In this Kata, you have to sort an array of non-negative integers according to
number of ones in their binary representation in ascending order.
For similar number of ones, sort based on decimal value.
It must be implemented like this:
>>> sort_array([1, 5, 2, 3, 4])
[1, 2, 3, 4, 5]
>>> sort_array([-2, -3, -4, -5, -6... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_116_sort_array.py | verbatim | using Test
@testset begin
candidate = sort_array;
@test(candidate([1, 5, 2, 3, 4]) == [1, 2, 4, 3, 5])
@test(candidate([-2, -3, -4, -5, -6]) == [-4, -2, -6, -5, -3])
@test(candidate([1, 0, 2, 3, 4]) == [0, 1, 2, 4, 3])
@test(candidate(Vector{Int64}([])) == Vector{Int64}([]))
@test(candidate([2, 5, 77, 4, 5, 3, 5... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_117_select_words | jl | """Given a string s and a natural number n, you have been tasked to implement
a function that returns a list of all words from string s that contain exactly
n consonants, in order these words appear in the string s.
If the string s is empty then the function should return an empty list.
Note: you may assume the input... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_117_select_words.py | verbatim | using Test
@testset begin
candidate = select_words;
@test(candidate("Mary had a little lamb", 4) == ["little"])
@test(candidate("Mary had a little lamb", 3) == ["Mary", "lamb"])
@test(candidate("simple white space", 2) == Vector{String}([]))
@test(candidate("Hello world", 4) == ["world"])
@test(candidate("Uncle ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_118_get_closest_vowel | jl | """You are given a word. Your task is to find the closest vowel that stands between
two consonants from the right side of the word (case sensitive).
Vowels in the beginning and ending doesn't count. Return empty string if you didn't
find any vowel met the above condition.
You may assume that the given string contains... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_118_get_closest_vowel.py | verbatim | using Test
@testset begin
candidate = get_closest_vowel;
@test(candidate("yogurt") == "u")
@test(candidate("full") == "u")
@test(candidate("easy") == "")
@test(candidate("eAsy") == "")
@test(candidate("ali") == "")
@test(candidate("bad") == "a")
@test(candidate("most") == "o")
@test(candidate("ab") == "")
@t... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_119_match_parens | jl | """You are given a list of two strings, both strings consist of open
parentheses '(' or close parentheses ')' only.
Your job is to check if it is possible to concatenate the two strings in
some order, that the resulting string will be good.
A string S is considered to be good if and only if all parentheses in S
are bal... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_119_match_parens.py | verbatim | using Test
@testset begin
candidate = match_parens;
@test(candidate(["()(", ")"]) == "Yes")
@test(candidate([")", ")"]) == "No")
@test(candidate(["(()(())", "())())"]) == "No")
@test(candidate([")())", "(()()("]) == "Yes")
@test(candidate(["(())))", "(()())(("]) == "Yes")
@test(candidate(["()", "())"]) == "No")... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_11_string_xor | jl | """ Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
>>> string_xor("010", "110")
"100""""
function string_xor(a::String, b::String)::String
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_11_string_xor.py | verbatim | using Test
@testset begin
candidate = string_xor;
@test(candidate("111000", "101010") == "010010")
@test(candidate("1", "1") == "0")
@test(candidate("0101", "0000") == "0101")
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_120_maximum | jl | """Given an array arr of integers and a positive integer k, return a sorted list
of length k with the maximum k numbers in arr.
Example 1:
>>> maximum([-3, -4, 5], 3)
[-4, -3, 5]
Example 2:
>>> maximum([4, -4, 4], 2)
[4, 4]
Example 3:
>>> maximum([-3, 2, 1, 2, -1, -2, 1], 1)
[2]
Note:
1. The length of the array wi... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_120_maximum.py | verbatim | using Test
@testset begin
candidate = maximum;
@test(candidate([-3, -4, 5], 3) == [-4, -3, 5])
@test(candidate([4, -4, 4], 2) == [4, 4])
@test(candidate([-3, 2, 1, 2, -1, -2, 1], 1) == [2])
@test(candidate([123, -123, 20, 0, 1, 2, -3], 3) == [2, 20, 123])
@test(candidate([-123, 20, 0, 1, 2, -3], 4) == [0, 1, 2, ... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_121_solution | jl | """Given a non-empty list of integers, return the sum of all of the odd elements that are in even positions.
Examples
>>> solution([5, 8, 7, 1])
12
>>> solution([3, 3, 3, 3, 3])
9
>>> solution([30, 13, 24, 321])
0"""
function solution(lst::Vector{Int64})::Int64
| transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_121_solution.py | verbatim | using Test
@testset begin
candidate = solution;
@test(candidate([5, 8, 7, 1]) == 12)
@test(candidate([3, 3, 3, 3, 3]) == 9)
@test(candidate([30, 13, 24, 321]) == 0)
@test(candidate([5, 9]) == 5)
@test(candidate([2, 4, 8]) == 0)
@test(candidate([30, 13, 23, 32]) == 23)
@test(candidate([3, 13, 2, 9]) == 3)
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_122_add_elements | jl | """Given a non-empty array of integers arr and an integer k, return
the sum of the elements with at most two digits from the first k elements of arr.
Example:
>>> add_elements([111, 21, 3, 4000, 5, 6, 7, 8, 9], 4)
24
Constraints:
1. 1 <= len(arr) <= 100
2. 1 <= k <= len(arr)"""
function add_elements(arr::Vector... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_122_add_elements.py | verbatim | using Test
@testset begin
candidate = add_elements;
@test(candidate([1, -2, -3, 41, 57, 76, 87, 88, 99], 3) == -4)
@test(candidate([111, 121, 3, 4000, 5, 6], 2) == 0)
@test(candidate([11, 21, 3, 90, 5, 6, 7, 8, 9], 4) == 125)
@test(candidate([111, 21, 3, 4000, 5, 6, 7, 8, 9], 4) == 24)
@test(candidate([1], 1) ==... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_123_get_odd_collatz | jl | """Given a positive integer n, return a sorted list that has the odd numbers in collatz sequence.
The Collatz conjecture is a conjecture in mathematics that concerns a sequence defined
as follows: start with any positive integer n. Then each term is obtained from the
previous term as follows: if the previous term is e... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_123_get_odd_collatz.py | verbatim | using Test
@testset begin
candidate = get_odd_collatz;
@test(candidate(14) == [1, 5, 7, 11, 13, 17])
@test(candidate(5) == [1, 5])
@test(candidate(12) == [1, 3, 5])
@test(candidate(1) == [1])
end
| [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_124_valid_date | jl | """You have to write a function which validates a given date string and
returns True if the date is valid otherwise False.
The date is valid if all of the following rules are satisfied:
1. The date string is not empty.
2. The number of days is not less than 1 or higher than 31 days for months 1,3,5,7,8,10,12. And the n... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_124_valid_date.py | verbatim | using Test
@testset begin
candidate = valid_date;
@test(candidate("03-11-2000") == true)
@test(candidate("15-01-2012") == false)
@test(candidate("04-0-2040") == false)
@test(candidate("06-04-2020") == true)
@test(candidate("01-01-2007") == true)
@test(candidate("03-32-2011") == false)
@test(candidate("") == fa... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_125_split_words | jl | """Given a string of words, return a list of words split on whitespace, if no whitespaces exists in the text you
should split on commas ',' if no commas exists you should return the number of lower-case letters with odd order in the
alphabet, ord('a') = 0, ord('b') = 1, ... ord('z') = 25
Examples
>>> split_words("Hello... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_125_split_words.py | verbatim | using Test
@testset begin
candidate = split_words;
@test(candidate("Hello world!") == ["Hello", "world!"])
@test(candidate("Hello,world!") == ["Hello", "world!"])
@test(candidate("Hello world,!") == ["Hello", "world,!"])
@test(candidate("Hello,Hello,world !") == ["Hello,Hello,world", "!"])
@test(candidate("abcde... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_126_is_sorted | jl | """Given a list of numbers, return whether or not they are sorted
in ascending order. If list has more than 1 duplicate of the same
number, return False. Assume no negative numbers and only integers.
Examples
>>> is_sorted([5])
true
>>> is_sorted([1, 2, 3, 4, 5])
true
>>> is_sorted([1, 3, 2, 4, 5])
false
>>> is_sorted(... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_126_is_sorted.py | verbatim | using Test
@testset begin
candidate = is_sorted;
@test(candidate([5]) == true)
@test(candidate([1, 2, 3, 4, 5]) == true)
@test(candidate([1, 3, 2, 4, 5]) == false)
@test(candidate([1, 2, 3, 4, 5, 6]) == true)
@test(candidate([1, 2, 3, 4, 5, 6, 7]) == true)
@test(candidate([1, 3, 2, 4, 5, 6, 7]) == false)
@test... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
HumanEval_127_intersection | jl | """You are given two intervals,
where each interval is a pair of integers. For example, interval = (start, end) = (1, 2).
The given intervals are closed which means that the interval (start, end)
includes both start and end.
For each given interval, it is assumed that its start is less or equal its end.
Your task is to... | transform | /home/arjun/repos/nuprl/MultiPL-E/datasets/../datasets/originals-with-cleaned-doctests/HumanEval_127_intersection.py | verbatim | using Test
@testset begin
candidate = intersection;
@test(candidate((1, 2), (2, 3)) == "NO")
@test(candidate((-1, 1), (0, 4)) == "NO")
@test(candidate((-3, -1), (-5, 5)) == "YES")
@test(candidate((-2, 2), (-4, 0)) == "YES")
@test(candidate((-11, 2), (-1, -1)) == "NO")
@test(candidate((1, 2), (3, 5)) == "NO")
@... | [
"\nfunction",
"\nmacro",
"\n\n"
] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.