content stringlengths 263 5.24M | pred_label stringclasses 1
value | pred_score_pos float64 0.6 1 |
|---|---|---|
"""
strange_sort_list(xs::Vector{Int})::Vector{Int}
Given list of integers, return list 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
```jldoctest
julia> strange_sort_list([1, 2, 3, 4])
4-element Vector{Int6... | __label__POS | 0.994947 |
"""
words_in_sentence(sentence::String)::String
You are given a string representing a sentence, the sentence contains some words
separated by a space, and you have to return a string that contains the words
from the original sentence, whose lengths are prime numbers, the order of the
words in the new string should... | __label__POS | 0.804359 |
"""
prime_fib(n::Int)::Int
Returns n-th number that is a Fibonacci number and it's also prime.
```jldoctest
julia> prime_fib(1)
2
julia> prime_fib(2)
3
julia> prime_fib(3)
5
julia> prime_fib(4)
13
julia> prime_fib(5)
89
```
"""
function prime_fib(n::Int)::Int
function isprime(x::Int)
if x <= 1
... | __label__POS | 0.999802 |
"""
get_odd_collatz(n::Int)::Vector{BigInt}
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 pre... | __label__POS | 0.98677 |
"""
valid_date(date::String)::Bool
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... | __label__POS | 0.92737 |
"""
bf(planet1::String, planet2::String)::NTuple
There are eight planets in our solar system: the closerst to the Sun is Mercury,
the next one is Venus, then Earth, Mars, Jupiter, Saturn, Uranus, Neptune. Write
a function that takes two planet names as strings `planet1` and `planet2`. The
function should return a ... | __label__POS | 0.816672 |
"""
vowels_count(s::String)::Int
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' in both lower and upper cases. Here, 'y' or 'Y' is also
a vowel, but only when it is at the end of the g... | __label__POS | 0.999798 |
"""
f(n::Int)::Vector{Int}
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 t... | __label__POS | 0.998416 |
"""
palindrome_with_append(s::String)::String
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... | __label__POS | 0.998963 |
"""
skjkasdkd(xs::Vector{Int})::Int
You are given a list of integers. You need to find the largest prime value and
return the sum of its digits.
# Examples
```jldoctest
julia> skjkasdkd([0, 3, 2, 1, 3, 5, 7, 4, 5, 5, 5, 2, 181, 32, 4, 32, 3, 2, 32, 324, 4, 3])
10
julia> skjkasdkd([1, 0, 1, 8, 2, 4597, 2, 1, 3, ... | __label__POS | 0.997705 |
"""
check_dict_case(d::Dict{String})::Bool
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
```jldoctest
julia> check_dict_case(Dict("a" => "apple", "... | __label__POS | 0.940657 |
"""
get_max_triples(n::Int)::Int
You are given a positive integer n. You have to create an integer array a of length n.
For each i (1 ≤ i ≤ n), the value of a[i] = i * i - i + 1.
Return the number of triples (a[i], a[j], a[k]) of a where i < j < k,
and a[i] + a[j] + a[k] is a multiple of 3.
# Examples
```jldocte... | __label__POS | 0.973029 |
"""
select_words(s::String, n::Int)::Vector{<:AbstractString}
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 the... | __label__POS | 0.999335 |
"""
total_match(xs::Vector{String}, ys::Vector{String})::Vector{String}
Write a function that accepts two lists of strings and returns the list that has
total number of chars in the all strings of the list less than the other list.
If the two lists have the same number of chars, return the first list.
# Examples... | __label__POS | 0.997118 |
"""
separate_paren_groups(paren_string::String)::Vector{String}
Input to this function is a string containing multiple groups of nested
parentheses. Your goal is to separate those group into separate strings and
return the list of those. Separate groups are balanced (each open brace is
properly closed) and not nes... | __label__POS | 0.999241 |
"""
count_up_to(n::Int)::Vector{Int}
Implement a function that takes an non-negative integer and returns an array of
the first n integers that are prime numbers and less than n.
# Example
```jldoctest
julia> count_up_to(5)
2-element Vector{Int64}:
2
3
julia> count_up_to(11)
4-element Vector{Int64}:
2
3
5
... | __label__POS | 0.999885 |
"""
move_one_ball(xs::Vector{Int})::Bool
We have an array `xs` of N integers xs[1], xs[2], ..., xs[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 allow... | __label__POS | 0.99966 |
"""
eat(number::Int, need::Int, remaining::Int)::Vector{Int}
You're a hungry rabbit, and you already have eaten a certain number of carrots,
but now you need to eat more carrots to complete the day's meals. you should
return an array of [ total number of eaten carrots after your meals, the number
of carrots left a... | __label__POS | 0.995418 |
"""
get_closest_vowel(word::String)::String
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.
... | __label__POS | 0.987597 |
"""
sorted_list_sum(xs::Vector{String})::Vector{String}
Write a function that accepts a list of strings as a parameter, deletes the
strings that have odd lengths from it, and returns the resulted list with a
sorted order,
The list is always a list of strings and never an array of numbers, and it may
contain dupli... | __label__POS | 0.998397 |
"""
exchange(lst1::Vector{Int}, lst2::Vector{Int})::String
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 ele... | __label__POS | 0.927024 |
"""
hex_key(num::String)::Int
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 a... | __label__POS | 0.966526 |
"""
do_algebra(operator::Vector{String}, operand::Vector{Int})
Given two lists operator, and operand. The first list has basic algebra
operations, and the second list is a list of integers. Use the two given lists
to build the algebric expression and return the evaluation of this expression.
The basic algebra ope... | __label__POS | 0.98064 |
"""
compare_one(a::Union{Integer, AbstractFloat, AbstractString}, b::Union{Integer, AbstractFloat, AbstractString})::Union{Integer, AbstractFloat, AbstractString, Nothing}
Create a function that takes integers, floats, or strings representing real
numbers, and returns the larger variable in its given variable type... | __label__POS | 0.940416 |
"""
simplify(x::String, n::String)::Bool
Your task is to implement a function that will simplify the expression x * n.
The function returns True if x * n evaluates to a whole number and False
otherwise. Both x and n, are string representation of a fraction, and have the
following format, <numerator>/<denominator> ... | __label__POS | 0.912617 |
"""
sort_array_based_on_head_tail(xs::Int)::Vector{Int}
Given an array of non-negative integers, return a copy of the given array after
sorting, you will sort the given array 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, la... | __label__POS | 0.99901 |
"""
find_max(words::Vector{String})::String
Write a function that accepts a list of strings. The list contains different
words. Return the word with maximum number of unique characters. If multiple
strings have maximum number of unique characters, return the one which comes
first in lexicographical order.
# Examp... | __label__POS | 0.999316 |
"""
is_sorted(xs::Vector{Int})::Bool
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
```jldoctest
julia> is_sorted([5])
true
julia> is_sorted([1, 2, 3... | __label__POS | 0.986234 |
"""
get_row(xs::Vector{Vector{Int}}, x::Int)::Vector{Tuple{Int, Int}}
You are given a 2 dimensional data, as a nested lists, which is similar to
matrix, however, unlike matrices, each row may contain a different number of
columns. Given `xs`, and integer `x`, find integers `x` in the list `xs`, and
return list of ... | __label__POS | 0.968063 |
"""
compare(game::Vector{Int}, guess::Vector{Int})::Vector{Int}
I think we all remember that feeling when the result of some long-awaited event
is finally known. The feelings and thoughts you have at that moment are
definitely worth noting down and comparing. Your task is to determine if a
person correctly guessed... | __label__POS | 0.951993 |
"""
cycpattern_check(a::String , b::String)::Bool
You are given 2 words. You need to return `true` if the second word or any of
its rotations is a substring in the first word.
# Example
```jldoctest
julia> cycpattern_check("abcd", "abd")
false
julia> cycpattern_check("hello", "ell")
true
julia> cycpattern_chec... | __label__POS | 0.997899 |
"""
is_multiply_prime(a::Int)::Bool
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.
# Examples
```jldoctest
julia> is_multiply_prime(30) # 30 = 2 * 3 * 5
true
```
"""
function is_multiply_prime(a::Int)::Boo... | __label__POS | 0.998353 |
"""
factorize(n::Int)::Vector{Int}
Return list of prime factors of given integer in the order from smallest to
largest. Each of the factors should be listed number of times corresponding to
how many times it appeares in factorization. Input number should be equal to the
product of all factors.
# Examples
```jldo... | __label__POS | 0.977603 |
"""
match_parens(lst::Vector{String})::String
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 ... | __label__POS | 0.985015 |
"""
file_name_check(file_name::String)::String
Create a function which takes a string representing a file's name, and returns
'Yes' if the the file's name is valid, and returns 'No' otherwise. A file's name
is considered to be valid if and only if all the following conditions are met:
- There should not be more tha... | __label__POS | 0.938716 |
"""
generate_integers(a::Int, b::Int)::Vector{Int}
Given two positive integers a and b, return the even digits between a and b, in
ascending order.
# Example
```jldoctest
julia> generate_integers(2, 8)
4-element Vector{Int64}:
2
4
6
8
julia> generate_integers(8, 2)
4-element Vector{Int64}:
2
4
6
8
juli... | __label__POS | 0.995742 |
"""
even_odd_palindrome(n::Int)::Tuple{Int, Int}
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.
!!! note
1. 1 <= n <= 10^3
2. returned tuple has the number of even and odd integer palindromes respectively.
... | __label__POS | 0.999748 |
"""
parse_nested_parens(paren_string::String)::Vector{Int}
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.
... | __label__POS | 0.971964 |
"""
intersection(interval1::Vector{Int}, interval2::Vector{Int})::String
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
inter... | __label__POS | 0.999773 |
"""
min_path(grid::Vector{Vector{Int}}, k::Int)::Vector{Int}
Given a grid with `N` rows and `N` columns (`N >= 2`) and a positive integer
`k`, each cell of the grid contains a value. Every integer in the range `[1, N * N]` inclusive appears exactly once on the cells of the grid.
You have to find the minimum path ... | __label__POS | 0.999705 |
"""
fruit_distribution(s::String, n::Int)::Int
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... | __label__POS | 0.913823 |
"""
find_closest_elements(numbers::Vector{Float64})::Tuple{Float64, Float64}
From a supplied list of numbers (of length at least two) select and return two
that are the closest to each other and return them in order (smaller number,
larger number).
# Examples
```jldoctest
julia> find_closest_elements([1.0, 2.0, ... | __label__POS | 0.997048 |
@testitem "118_get_closest_vowel_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "118_get_closest_vowel.jl"))
@test get_closest_vowel("hello") == "e"
@test get_closest_vowel("cup") == "u"
@test get_closest_vowel("kill") == "i"
@test get_closes... | __label__POS | 0.998489 |
@testitem "005_intersperse_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "005_intersperse.jl"))
@test intersperse([1, 2, 3],0) == [1, 0, 2, 0, 3]
@test intersperse([2, 4, 6, 8],1) == [2, 1, 4, 1, 6, 1, 8]
@test intersperse([9, 9, 9, 9, 9, 9],7) ... | __label__POS | 0.996331 |
@testitem "065_circular_shift_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "065_circular_shift.jl"))
@test circular_shift(16,3) == "61"
@test circular_shift(1234,6) == "4321"
@test circular_shift(341209,4) == "120934"
@test circular_shift(7... | __label__POS | 0.930664 |
@testitem "071_triangle_area3_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "071_triangle_area3.jl"))
@test triangle_area3(8,9,15) == 29.93
@test triangle_area3(10,12,15) == 59.81
@test triangle_area3(7,7,10) == 24.49
@test triangle_area3(3.... | __label__POS | 0.990348 |
@testitem "155_even_odd_count_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "155_even_odd_count.jl"))
@test even_odd_count(2368) == (3, 1)
@test even_odd_count(-111) == (0, 3)
@test even_odd_count(-2468031) == (5, 2)
@test even_odd_count(101... | __label__POS | 0.923281 |
@testitem "045_triangle_area_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "045_triangle_area.jl"))
@test triangle_area(4,6) == 12.0
@test triangle_area(7,2) == 7.0
@test triangle_area(12,5) == 30.0
@test triangle_area(3,4) == 6.0
@test ... | __label__POS | 0.930818 |
@testitem "110_exchange_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "110_exchange.jl"))
@test exchange([2, 4, 6],[1, 3, 5]) == "YES"
@test exchange([1, 3, 5],[2, 4, 6]) == "YES"
@test exchange([2, 2, 2],[1, 3, 5]) == "YES"
@test exchange([... | __label__POS | 0.873093 |
@testitem "084_n_digits_in_binary_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "084_n_digits_in_binary.jl"))
@test n_digits_in_binary(1) == "1"
@test n_digits_in_binary(10) == "1"
@test n_digits_in_binary(101) == "10"
@test n_digits_in_bina... | __label__POS | 0.924104 |
@testitem "028_concatenate_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "028_concatenate.jl"))
@test concatenate(["apple", "banana", "orange"]) == "applebananaorange"
@test concatenate(["python", "is", "a", "great", "language"]) == "pythonisagreatl... | __label__POS | 0.624907 |
@testitem "116_sort_array_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "116_sort_array.jl"))
@test sort_array([3, 7, 6, 5, 4]) == [4, 3, 5, 6, 7]
@test sort_array([10, 8, 12, 11, 9]) == [8, 9, 10, 12, 11]
@test sort_array([111, 222, 333, 444]) ... | __label__POS | 0.685663 |
@testitem "156_int_to_mini_roman_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "156_int_to_mini_roman.jl"))
@test int_to_mini_roman(111) == "cxi"
@test int_to_mini_roman(888) == "dccclxxxviii"
@test int_to_mini_roman(2) == "ii"
@test int_to_... | __label__POS | 0.935078 |
@testitem "079_decimal_to_binary_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "079_decimal_to_binary.jl"))
@test decimal_to_binary(100001) == "db11000011010100001db"
@test decimal_to_binary(255) == "db11111111db"
@test decimal_to_binary(9999999... | __label__POS | 0.935331 |
@testitem "041_car_race_collision_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "041_car_race_collision.jl"))
@test car_race_collision(5) == 25
@test car_race_collision(6) == 36
@test car_race_collision(12) == 144
@test car_race_collision(15... | __label__POS | 0.831233 |
@testitem "147_get_max_triples_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "147_get_max_triples.jl"))
@test get_max_triples(1) == 0
@test get_max_triples(2) == 0
@test get_max_triples(3) == 0
@test get_max_triples(4) == 1
@test get_max... | __label__POS | 0.883439 |
@testitem "121_sum_odd_at_odd_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "121_sum_odd_at_odd.jl"))
@test sum_odd_at_odd([1, 2, 3, 4, 5, 6]) == 9
@test sum_odd_at_odd([0, 1, 2, 3, 4, 5, 6, 7]) == 0
@test sum_odd_at_odd([2, 5, 10, 11, 18]) == 0... | __label__POS | 0.64148 |
@testitem "060_sum_to_n_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "060_sum_to_n.jl"))
@test sum_to_n(2) == 3
@test sum_to_n(3) == 6
@test sum_to_n(4) == 10
@test sum_to_n(7) == 28
@test sum_to_n(15) == 120
@test sum_to_n(20) == 2... | __label__POS | 0.898552 |
@testitem "087_get_row_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "087_get_row.jl"))
@test get_row([Int64[], Int64[], Int64[], Int64[]],10) == Tuple{Int64, Int64}[]
@test get_row([[1, 2, 3], [4, 5, 6]],5) == [(2, 2)]
@test get_row([[1, 1], [1... | __label__POS | 0.980077 |
@testitem "114_min_sub_array_sum_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "114_min_sub_array_sum.jl"))
@test min_sub_array_sum([2, 4, -1, 3, 5, -4, 1, -2]) == -5
@test min_sub_array_sum([4, -4, -5, -3, 5, -1, 6]) == -12
@test min_sub_array_... | __label__POS | 0.726831 |
@testitem "016_count_distinct_characters_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "016_count_distinct_characters.jl"))
@test count_distinct_characters("AbCdEfG") == 7
@test count_distinct_characters("banana") == 3
@test count_distinct_chara... | __label__POS | 0.806614 |
@testitem "029_filter_by_prefix_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "029_filter_by_prefix.jl"))
@test filter_by_prefix(String[],"") == String[]
@test filter_by_prefix(["abc", "abcd", "abcde"],"abc") == ["abc", "abcd", "abcde"]
@test fi... | __label__POS | 0.998246 |
@testitem "091_is_bored_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "091_is_bored.jl"))
@test is_bored("I am very happy today. I love spending time with my friends.") == 2
@test is_bored("I want to eat pizza for dinner. What do you think, should w... | __label__POS | 0.998453 |
@testitem "139_special_factorial_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "139_special_factorial.jl"))
@test special_factorial(2) == 2
@test special_factorial(3) == 12
@test special_factorial(6) == 24883200
@test special_factorial(8) ==... | __label__POS | 0.919389 |
@testitem "161_reverse_string_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "161_reverse_string.jl"))
@test reverse_string("") == ""
@test reverse_string("ABCDEFG") == "abcdefg"
@test reverse_string("racecar") == "RACECAR"
@test reverse_stri... | __label__POS | 0.883825 |
@testitem "010_palindrome_with_append_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "010_palindrome_with_append.jl"))
@test palindrome_with_append("race") == "racecar"
@test palindrome_with_append("level") == "level"
@test palindrome_with_append... | __label__POS | 0.937038 |
@testitem "120_top_k_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "120_top_k.jl"))
@test top_k([1, 2, 3, 4, 5],3) == [5, 4, 3]
@test top_k([-1, -2, -3, -4, -5],2) == [-1, -2]
@test top_k([2, 2, 2, 2, 2],3) == [2, 2, 2]
@test top_k([0, 0, 0,... | __label__POS | 0.819768 |
@testitem "163_generate_integers_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "163_generate_integers.jl"))
@test generate_integers(6,12) == [6, 8]
@test generate_integers(13,25) == Int64[]
@test generate_integers(50,60) == Int64[]
@test gen... | __label__POS | 0.940612 |
@testitem "022_filter_integers_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "022_filter_integers.jl"))
@test filter_integers([1, 2, 3, 4, 5]) == [1, 2, 3, 4, 5]
@test filter_integers(Any[1, "2", "3", 4, -5]) == [1, 4, -5]
@test filter_integers(... | __label__POS | 0.997828 |
@testitem "030_get_positive_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "030_get_positive.jl"))
@test get_positive([0, 1, -1, 2, -2, 3, -3, 4, -4]) == [1, 2, 3, 4]
@test get_positive([1, -1, 2, -2, 3, -3, 4, -4, 0]) == [1, 2, 3, 4]
@test get_p... | __label__POS | 0.965647 |
@testitem "033_sort_third_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "033_sort_third.jl"))
@test sort_third([9, 12, 15, 6, 3, 8, 10, 23, 7]) == [9, 12, 7, 6, 3, 8, 10, 23, 15]
@test sort_third([2, 1, 3, 7, 8, 9, 10]) == [2, 1, 3, 7, 8, 9, 10]
... | __label__POS | 0.801773 |
@testitem "046_fib4_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "046_fib4.jl"))
@test fib4(1) == 0
@test fib4(2) == 2
@test fib4(3) == 0
@test fib4(4) == 2
@test fib4(6) == 8
@test fib4(7) == 14
@test fib4(9) == 54
@test fi... | __label__POS | 0.928366 |
@testitem "113_odd_count_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "113_odd_count.jl"))
@test odd_count(["2468"]) == ["the number of odd elements 0n the str0ng 0 of the 0nput."]
@test odd_count(String[]) == String[]
@test odd_count(["0", "00... | __label__POS | 0.890152 |
@testitem "103_rounded_avg_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "103_rounded_avg.jl"))
@test rounded_avg(1,1) == "1"
@test rounded_avg(3,9) == "110"
@test rounded_avg(25,35) == "11110"
@test rounded_avg(10,30) == "10100"
@test r... | __label__POS | 0.994528 |
@testitem "149_sorted_list_sum_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "149_sorted_list_sum.jl"))
@test sorted_list_sum(["programming", "python", "java", "ruby"]) == ["java", "ruby", "python"]
@test sorted_list_sum(["apple", "orange", "banana"... | __label__POS | 0.62572 |
@testitem "119_match_parens_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "119_match_parens.jl"))
@test match_parens(["(", "("]) == "No"
@test match_parens(["))", "))"]) == "No"
@test match_parens(["(", "()())("]) == "No"
@test match_parens(... | __label__POS | 0.987933 |
@testitem "014_all_prefixes_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "014_all_prefixes.jl"))
@test all_prefixes("Hello there!") == ["H", "He", "Hel", "Hell", "Hello", "Hello ", "Hello t", "Hello th", "Hello the", "Hello ther", "Hello there", "Hello... | __label__POS | 0.742126 |
@testitem "036_fizz_buzz_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "036_fizz_buzz.jl"))
@test fizz_buzz(1) == 0
@test fizz_buzz(10) == 0
@test fizz_buzz(20) == 0
@test fizz_buzz(30) == 0
@test fizz_buzz(70) == 0
@test fizz_buzz(7... | __label__POS | 0.969907 |
@testitem "006_parse_nested_parens_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "006_parse_nested_parens.jl"))
@test parse_nested_parens("") == Int64[]
@test parse_nested_parens("((()))") == [3]
@test parse_nested_parens("(())(()())") == [2]
... | __label__POS | 0.919243 |
@testitem "099_closest_integer_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "099_closest_integer.jl"))
@test closest_integer("-2.8") == -3
@test closest_integer("3.6") == 4
@test closest_integer("5.5") == 6
@test closest_integer("-6.5") == ... | __label__POS | 0.948558 |
@testitem "135_can_arrange_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "135_can_arrange.jl"))
@test can_arrange([1]) == -1
@test can_arrange([1, 2, 3, 4, 5]) == -1
@test can_arrange([5, 4, 3, 2, 1]) == 5
@test can_arrange([1, 3, 5, 4, 6, 7... | __label__POS | 0.958606 |
@testitem "001_separate_paren_groups_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "001_separate_paren_groups.jl"))
@test separate_paren_groups("()") == ["()"]
@test separate_paren_groups("(())") == ["(())"]
@test separate_paren_groups("((()))()... | __label__POS | 0.897137 |
@testitem "050_decode_shift_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "050_decode_shift.jl"))
@test decode_shift("abcdefghijklmnopqrstuvwxyz") == "vwxyzabcdefghijklmnopqrstu"
@test decode_shift("encoded message with shift") == "zixjyzyOhznnvbzOr... | __label__POS | 0.863304 |
@testitem "051_remove_vowels_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "051_remove_vowels.jl"))
@test remove_vowels("hello") == "hll"
@test remove_vowels("This is a Test!") == "Ths s Tst!"
@test remove_vowels("i am using python") == " m sng... | __label__POS | 0.78677 |
@testitem "160_do_algebra_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "160_do_algebra.jl"))
@test do_algebra(["+", "-", "*", "÷"],[5, 2, 3, 4, 7]) == 6
@test do_algebra(["^", "-", "÷"],[9, 2, 5, 3]) == 80
@test do_algebra(["*", "-", "*", "÷"],... | __label__POS | 0.824091 |
@testitem "153_strongest_extension_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "153_strongest_extension.jl"))
@test strongest_extension("Test1",["UPPERCASE", "uppercase", "1111"]) == "Test1.UPPERCASE"
@test strongest_extension("Test2",["capitalLET... | __label__POS | 0.753876 |
@testitem "068_pluck_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "068_pluck.jl"))
@test pluck([1, 3, 5, 7, 9]) == Int64[]
@test pluck([2, 2, 2, 2, 2, 2]) == [2, 1]
@test pluck([7, 15, 12, 21, 8, 13]) == [8, 5]
@test pluck([2, 5, 7, 9, 11])... | __label__POS | 0.93953 |
@testitem "053_add_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "053_add.jl"))
@test add(-2,3) == 1
@test add(0,0) == 0
@test add(-5,-7) == -12
@test add(10,-15) == -5
@test add(999,1) == 1000
@test add(-10,10) == 0
@test add(10... | __label__POS | 0.916988 |
@testitem "150_x_or_y_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "150_x_or_y.jl"))
@test x_or_y(-2,0,1) == 1
@test x_or_y(0,500,1000) == 1000
@test x_or_y(11,1,0) == 1
@test x_or_y(25,-25,25) == 25
@test x_or_y(37,123,456) == 123
... | __label__POS | 0.721724 |
@testitem "025_factorize_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "025_factorize.jl"))
@test factorize(10) == [2, 5]
@test factorize(15) == [3, 5]
@test factorize(28) == [2, 2, 7]
@test factorize(1024) == [2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
... | __label__POS | 0.988574 |
@testitem "044_change_base_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "044_change_base.jl"))
@test change_base(10,5) == "20"
@test change_base(15,4) == "33"
@test change_base(25,6) == "41"
@test change_base(33,7) == "45"
@test change_... | __label__POS | 0.940854 |
@testitem "136_largest_smallest_integers_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "136_largest_smallest_integers.jl"))
@test largest_smallest_integers([9, -4, -6, 5, 0, -2]) == (-2, 5)
@test largest_smallest_integers([1, 1, 1, 1, 1, 1]) == (not... | __label__POS | 0.724723 |
@testitem "038_decode_cyclic_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "038_decode_cyclic.jl"))
@test decode_cyclic("abcdefghijk") == "cabfdeighjk"
@test decode_cyclic("abcdefghijklmnopqrstuvwxyz") == "cabfdeighljkomnrpqustxvwyz"
@test decod... | __label__POS | 0.831622 |
@testitem "040_triples_sum_to_zero_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "040_triples_sum_to_zero.jl"))
@test triples_sum_to_zero([0, 0, 0]) == true
@test triples_sum_to_zero([1, 1, -2, -2]) == true
@test triples_sum_to_zero([2, 3, -5, 0... | __label__POS | 0.746789 |
@testitem "019_sort_numbers_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "019_sort_numbers.jl"))
@test sort_numbers("four eight two") == "two four eight"
@test sort_numbers("nine") == "nine"
@test sort_numbers("one six two four nine") == "one t... | __label__POS | 0.995659 |
@testitem "011_string_xor_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "011_string_xor.jl"))
@test string_xor("000","000") == "000"
@test string_xor("1111","1111") == "0000"
@test string_xor("10101","01010") == "11111"
@test string_xor("010... | __label__POS | 0.933173 |
@testitem "057_monotonic_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "057_monotonic.jl"))
@test monotonic([10, 9, 8, 7, 6]) == true
@test monotonic([1, 1, 1, 1, 1]) == true
@test monotonic([-5, -7, -9, -11]) == true
@test monotonic([1, 1, ... | __label__POS | 0.832953 |
@testitem "034_unique_elements_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "034_unique_elements.jl"))
@test unique_elements([1, 1, 1, 1]) == [1]
@test unique_elements([2, 1, 2, 1]) == [1, 2]
@test unique_elements([0, 0, 0, 0]) == [0]
@test... | __label__POS | 0.615083 |
@testitem "037_sort_even_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "037_sort_even.jl"))
@test sort_even([2, 6, 4, 8, 10]) == [2, 6, 4, 8, 10]
@test sort_even([1, 0, 3, 6, 5]) == [1, 0, 3, 6, 5]
@test sort_even([3, 3, 2, 2, 1, 1]) == [3, 1, 2... | __label__POS | 0.940278 |
@testitem "073_smallest_change_HumanEvalPlus_v0_1_9_test.jl" tags=[:HumanEvalPlus_v0_1_9] begin
include(joinpath(ENV["GENERATION_DIR"], "073_smallest_change.jl"))
@test smallest_change([1, 2, 3, 4, 5]) == 2
@test smallest_change([1, 2, 2, 1]) == 0
@test smallest_change([1, 1, 1, 1]) == 0
@test small... | __label__POS | 0.656552 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.