name
stringlengths 15
44
| language
stringclasses 1
value | prompt
stringlengths 89
1.25k
| doctests
stringclasses 1
value | prompt_terminology
stringclasses 1
value | tests
stringlengths 194
1.5k
| stop_tokens
sequencelengths 3
3
|
|---|---|---|---|---|---|---|
HumanEval_103_rounded_avg | clj | (defn rounded_avg
"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_avg 10 20)
"0b1111"
>>> (rounded_avg 20 33)
"0b11010""
[n m]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate rounded_avg)
(deftest test-humaneval
(is (= (candidate 1 5) "0b11"))
(is (= (candidate 7 13) "0b1010"))
(is (= (candidate 964 977) "0b1111001010"))
(is (= (candidate 996 997) "0b1111100100"))
(is (= (candidate 560 851) "0b1011000010"))
(is (= (candidate 185 546) "0b101101110"))
(is (= (candidate 362 496) "0b110101101"))
(is (= (candidate 350 902) "0b1001110010"))
(is (= (candidate 197 233) "0b11010111"))
(is (= (candidate 7 5) -1))
(is (= (candidate 5 1) -1))
(is (= (candidate 5 5) "0b101"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_104_unique_digits | clj | (defn unique_digits
"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])
[]"
[x]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate unique_digits)
(deftest test-humaneval
(is (= (candidate [15 33 1422 1]) [1 15 33]))
(is (= (candidate [152 323 1422 10]) []))
(is (= (candidate [12345 2033 111 151]) [111 151]))
(is (= (candidate [135 103 31]) [31 135]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_105_by_length | clj | (defn by_length
"Given a vector of integers, sort the integers that are between 1 and 9 inclusive,
reverse the resulting vector, 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" "Four" "Three" "Two" "Two" "One" "One"]
If the vector is empty, return an empty vector:
>>> (by_length [])
[]
If the vector has any strange number ignore it:
>>> (by_length [1 -1 55])
["One"]"
[arr]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate by_length)
(deftest test-humaneval
(is (= (candidate [2 1 1 4 5 8 2 3]) ["Eight" "Five" "Four" "Three" "Two" "Two" "One" "One"]))
(is (= (candidate []) []))
(is (= (candidate [1 -1 55]) ["One"]))
(is (= (candidate [1 -1 3 2]) ["Three" "Two" "One"]))
(is (= (candidate [9 4 8]) ["Nine" "Eight" "Four"]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_106_f | clj | (defn f
" 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).
Example:
>>> (f 5)
[1 2 6 24 15]"
[n]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate f)
(deftest test-humaneval
(is (= (candidate 5) [1 2 6 24 15]))
(is (= (candidate 7) [1 2 6 24 15 720 28]))
(is (= (candidate 1) [1]))
(is (= (candidate 3) [1 2 6]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_107_even_odd_palindrome | clj | (defn even_odd_palindrome
"Given a positive integer n, return a vector 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_palindrome 12)
[4 6]
Explanation:
Integer palindrome are 1, 2, 3, 4, 5, 6, 7, 8, 9, 11. four of them are even, and 6 of them are odd.
Note:
1. 1 <= n <= 10^3
2. returned vector has the number of even and odd integer palindromes respectively."
[n]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate even_odd_palindrome)
(deftest test-humaneval
(is (= (candidate 123) [8 13]))
(is (= (candidate 12) [4 6]))
(is (= (candidate 3) [1 2]))
(is (= (candidate 63) [6 8]))
(is (= (candidate 25) [5 6]))
(is (= (candidate 19) [4 6]))
(is (= (candidate 9) [4 5]))
(is (= (candidate 1) [0 1]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_108_count_nums | clj | (defn count_nums
"Write a function count_nums which takes a vector 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])
3"
[arr]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate count_nums)
(deftest test-humaneval
(is (= (candidate []) 0))
(is (= (candidate [-1 -2 0]) 0))
(is (= (candidate [1 1 2 -2 3 4 5]) 6))
(is (= (candidate [1 6 9 -6 0 1 5]) 5))
(is (= (candidate [1 100 98 -7 1 -1]) 4))
(is (= (candidate [12 23 34 -45 -56 0]) 5))
(is (= (candidate [0 1]) 1))
(is (= (candidate [1]) 1))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_109_move_one_ball | clj | (defn move_one_ball
"We have a vector 'arr' of N integers arr[1], arr[2], ..., arr[N].The
numbers in the vector will be randomly ordered. Your task is to determine if
it is possible to get a vector sorted in non-decreasing order by performing
the following operation on the given vector:
You are allowed to perform right shift operation any number of times.
One right shift operation means shifting all elements of the vector by one
position in the right direction. The last element of the vector will be moved to
the starting position in the vector i.e. 0th index.
If it is possible to obtain the sorted vector by performing the above operation
then return true else return false.
If the given vector is empty then return true.
Note: The given list is guaranteed to have unique elements.
For Example:
>>> (move_one_ball [3 4 5 1 2])
true
Explanation: By performin 2 right shift operations, non-decreasing order can
be achieved for the given vector.
>>> (move_one_ball [3 5 4 1 2])
false
Explanation:It is not possible to get non-decreasing order for the given
vector by performing any number of right shift operations."
[arr]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate move_one_ball)
(deftest test-humaneval
(is (= (candidate [3 4 5 1 2]) true))
(is (= (candidate [3 5 10 1 2]) true))
(is (= (candidate [4 3 1 2]) false))
(is (= (candidate [3 5 4 1 2]) false))
(is (= (candidate []) true))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_110_exchange | clj | (defn exchange
"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 elements between the lst1 and lst2 to make
all the elements of lst1 to be even, return "YES".
Otherwise, return "NO".
For example:
>>> (exchange [1 2 3 4] [1 2 3 4])
"YES"
>>> (exchange [1 2 3 4] [1 5 3 4])
"NO"
It is assumed that the input lists will be non-empty."
[lst1 lst2]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate exchange)
(deftest test-humaneval
(is (= (candidate [1 2 3 4] [1 2 3 4]) "YES"))
(is (= (candidate [1 2 3 4] [1 5 3 4]) "NO"))
(is (= (candidate [1 2 3 4] [2 1 4 3]) "YES"))
(is (= (candidate [5 7 3] [2 6 4]) "YES"))
(is (= (candidate [5 7 3] [2 6 3]) "NO"))
(is (= (candidate [3 2 6 1 8 9] [3 5 5 1 1 1]) "NO"))
(is (= (candidate [100 200] [200 200]) "YES"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_111_histogram | clj | (defn histogram
"Given a string representing a space separated lowercase letters, return a map
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")
{"a" 1 "b" 1 "c" 1}
>>> (histogram "a b b a")
{"a" 2 "b" 2}
>>> (histogram "a b c a b")
{"a" 2 "b" 2}
>>> (histogram "b b b b a")
{"b" 4}
>>> (histogram "")
{}"
[test]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate histogram)
(deftest test-humaneval
(is (= (candidate "a b b a") {"a" 2 "b" 2}))
(is (= (candidate "a b c a b") {"a" 2 "b" 2}))
(is (= (candidate "a b c d g") {"a" 1 "b" 1 "c" 1 "d" 1 "g" 1}))
(is (= (candidate "r t g") {"r" 1 "t" 1 "g" 1}))
(is (= (candidate "b b b b a") {"b" 4}))
(is (= (candidate "r t g") {"r" 1 "t" 1 "g" 1}))
(is (= (candidate "") {}))
(is (= (candidate "a") {"a" 1}))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_112_reverse_delete | clj | (defn reverse_delete
"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 vector containing the result string and true/false for the check.
Example
>>> (reverse_delete "abcde" "ae")
["bcd" false]
>>> (reverse_delete "abcdef" "b")
["acdef" false]
>>> (reverse_delete "abcdedcba" "ab")
["cdedc" true]"
[s c]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate reverse_delete)
(deftest test-humaneval
(is (= (candidate "abcde" "ae") ["bcd" false]))
(is (= (candidate "abcdef" "b") ["acdef" false]))
(is (= (candidate "abcdedcba" "ab") ["cdedc" true]))
(is (= (candidate "dwik" "w") ["dik" false]))
(is (= (candidate "a" "a") ["" true]))
(is (= (candidate "abcdedcba" "") ["abcdedcba" true]))
(is (= (candidate "abcdedcba" "v") ["abcdedcba" true]))
(is (= (candidate "vabba" "v") ["abba" true]))
(is (= (candidate "mamma" "mia") ["" true]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_113_odd_count | clj | (defn odd_count
"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 number of odd elements 4n the str4ng 4 of the 4nput."]
>>> (odd_count ["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."]"
[lst]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate odd_count)
(deftest test-humaneval
(is (= (candidate ["1234567"]) ["the number of odd elements 4n the str4ng 4 of the 4nput."]))
(is (= (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."]))
(is (= (candidate ["271" "137" "314"]) ["the number of odd elements 2n the str2ng 2 of the 2nput." "the number of odd elements 3n the str3ng 3 of the 3nput." "the number of odd elements 2n the str2ng 2 of the 2nput."]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_114_minSubArraySum | clj | (defn minSubArraySum
"Given a vector of integers nums, find the minimum sum of any non-empty sub-vector
of nums.
Example
>>> (minSubArraySum [2 3 4 1 2 4])
1
>>> (minSubArraySum [-1 -2 -3])
-6"
[nums]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate minSubArraySum)
(deftest test-humaneval
(is (= (candidate [2 3 4 1 2 4]) 1))
(is (= (candidate [-1 -2 -3]) -6))
(is (= (candidate [-1 -2 -3 2 -10]) -14))
(is (= (candidate [-9999999999999999]) -9999999999999999))
(is (= (candidate [0 10 20 1000000]) 0))
(is (= (candidate [-1 -2 -3 10 -5]) -6))
(is (= (candidate [100 -1 -2 -3 10 -5]) -6))
(is (= (candidate [10 11 13 8 3 4]) 3))
(is (= (candidate [100 -33 32 -1 0 -2]) -33))
(is (= (candidate [-10]) -10))
(is (= (candidate [7]) 7))
(is (= (candidate [1 -1]) -1))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_115_max_fill | clj | (defn max_fill
"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 number of times you need to lower the buckets.
Example 1:
>>> (max_fill [[0 0 1 0] [0 1 0 0] [1 1 1 1]] 1)
6
Example 2:
>>> (max_fill [[0 0 1 1] [0 0 0 0] [1 1 1 1] [0 1 1 1]] 2)
5
Example 3:
>>> (max_fill [[0 0 0] [0 0 0]] 5)
0
Constraints:
* all wells have the same length
* 1 <= grid.length <= 10^2
* 1 <= grid[:,1].length <= 10^2
* grid[i][j] -> 0 | 1
* 1 <= capacity <= 10"
[grid capacity]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate max_fill)
(deftest test-humaneval
(is (= (candidate [[0 0 1 0] [0 1 0 0] [1 1 1 1]] 1) 6))
(is (= (candidate [[0 0 1 1] [0 0 0 0] [1 1 1 1] [0 1 1 1]] 2) 5))
(is (= (candidate [[0 0 0] [0 0 0]] 5) 0))
(is (= (candidate [[1 1 1 1] [1 1 1 1]] 2) 4))
(is (= (candidate [[1 1 1 1] [1 1 1 1]] 9) 2))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_116_sort_array | clj | (defn sort_array
"In this Kata, you have to sort a vector 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])
[-6 -5 -4 -3 -2]
>>> (sort_array [1 0 2 3 4])
[0 1 2 3 4]"
[arr]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate sort_array)
(deftest test-humaneval
(is (= (candidate [1 5 2 3 4]) [1 2 4 3 5]))
(is (= (candidate [-2 -3 -4 -5 -6]) [-4 -2 -6 -5 -3]))
(is (= (candidate [1 0 2 3 4]) [0 1 2 4 3]))
(is (= (candidate []) []))
(is (= (candidate [2 5 77 4 5 3 5 7 2 3 4]) [2 2 4 4 3 3 5 5 5 7 77]))
(is (= (candidate [3 6 44 12 32 5]) [32 3 5 6 12 44]))
(is (= (candidate [2 4 8 16 32]) [2 4 8 16 32]))
(is (= (candidate [2 4 8 16 32]) [2 4 8 16 32]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_117_select_words | clj | (defn select_words
"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 string contains only letters and spaces.
Examples:
>>> (select_words "Mary had a little lamb" 4)
["little"]
>>> (select_words "Mary had a little lamb" 3)
["Mary" "lamb"]
>>> (select_words "simple white space" 2)
[]
>>> (select_words "Hello world" 4)
["world"]
>>> (select_words "Uncle sam" 3)
["Uncle"]"
[s n]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate select_words)
(deftest test-humaneval
(is (= (candidate "Mary had a little lamb" 4) ["little"]))
(is (= (candidate "Mary had a little lamb" 3) ["Mary" "lamb"]))
(is (= (candidate "simple white space" 2) []))
(is (= (candidate "Hello world" 4) ["world"]))
(is (= (candidate "Uncle sam" 3) ["Uncle"]))
(is (= (candidate "" 4) []))
(is (= (candidate "a b c d e f" 1) ["b" "c" "d" "f"]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_118_get_closest_vowel | clj | (defn get_closest_vowel
"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 English letter only.
Example:
>>> (get_closest_vowel "yogurt")
"u"
>>> (get_closest_vowel "FULL")
"U"
>>> (get_closest_vowel "quick")
""
>>> (get_closest_vowel "ab")
"""
[word]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate get_closest_vowel)
(deftest test-humaneval
(is (= (candidate "yogurt") "u"))
(is (= (candidate "full") "u"))
(is (= (candidate "easy") ""))
(is (= (candidate "eAsy") ""))
(is (= (candidate "ali") ""))
(is (= (candidate "bad") "a"))
(is (= (candidate "most") "o"))
(is (= (candidate "ab") ""))
(is (= (candidate "ba") ""))
(is (= (candidate "quick") ""))
(is (= (candidate "anime") "i"))
(is (= (candidate "Asia") ""))
(is (= (candidate "Above") "o"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_119_match_parens | clj | (defn match_parens
"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 balanced. For example: the string '(())()' is good, while the string
'())' is not.
Return 'Yes' if there's a way to make a good string, and return 'No' otherwise.
Examples:
>>> (match_parens ["()(" ")"])
"Yes"
>>> (match_parens [")" ")"])
"No""
[lst]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate match_parens)
(deftest test-humaneval
(is (= (candidate ["()(" ")"]) "Yes"))
(is (= (candidate [")" ")"]) "No"))
(is (= (candidate ["(()(())" "())())"]) "No"))
(is (= (candidate [")())" "(()()("]) "Yes"))
(is (= (candidate ["(())))" "(()())(("]) "Yes"))
(is (= (candidate ["()" "())"]) "No"))
(is (= (candidate ["(()(" "()))()"]) "Yes"))
(is (= (candidate ["((((" "((())"]) "No"))
(is (= (candidate [")(()" "(()("]) "No"))
(is (= (candidate [")(" ")("]) "No"))
(is (= (candidate ["(" ")"]) "Yes"))
(is (= (candidate [")" "("]) "Yes"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_120_maximum | clj | (defn maximum
"Given a vector 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 vector will be in the range of [1, 1000].
2. The elements in the vector will be in the range of [-1000, 1000].
3. 0 <= k <= len(arr)"
[arr k]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate maximum)
(deftest test-humaneval
(is (= (candidate [-3 -4 5] 3) [-4 -3 5]))
(is (= (candidate [4 -4 4] 2) [4 4]))
(is (= (candidate [-3 2 1 2 -1 -2 1] 1) [2]))
(is (= (candidate [123 -123 20 0 1 2 -3] 3) [2 20 123]))
(is (= (candidate [-123 20 0 1 2 -3] 4) [0 1 2 20]))
(is (= (candidate [5 15 0 3 -13 -8 0] 7) [-13 -8 0 0 3 5 15]))
(is (= (candidate [-1 0 2 5 3 -10] 2) [3 5]))
(is (= (candidate [1 0 5 -7] 1) [5]))
(is (= (candidate [4 -4] 2) [-4 4]))
(is (= (candidate [-10 10] 2) [-10 10]))
(is (= (candidate [1 2 3 -23 243 -400 0] 0) []))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_121_solution | clj | (defn solution
"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"
[lst]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate solution)
(deftest test-humaneval
(is (= (candidate [5 8 7 1]) 12))
(is (= (candidate [3 3 3 3 3]) 9))
(is (= (candidate [30 13 24 321]) 0))
(is (= (candidate [5 9]) 5))
(is (= (candidate [2 4 8]) 0))
(is (= (candidate [30 13 23 32]) 23))
(is (= (candidate [3 13 2 9]) 3))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_122_add_elements | clj | (defn add_elements
"Given a non-empty vector 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)"
[arr k]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate add_elements)
(deftest test-humaneval
(is (= (candidate [1 -2 -3 41 57 76 87 88 99] 3) -4))
(is (= (candidate [111 121 3 4000 5 6] 2) 0))
(is (= (candidate [11 21 3 90 5 6 7 8 9] 4) 125))
(is (= (candidate [111 21 3 4000 5 6 7 8 9] 4) 24))
(is (= (candidate [1] 1) 1))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_123_get_odd_collatz | clj | (defn get_odd_collatz
"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 even, the next term is one half of
the previous term. If the previous term is odd, the next term is 3 times the previous
term plus 1. The conjecture is that no matter what value of n, the sequence will always reach 1.
Note:
1. Collatz(1) is [1].
2. returned list sorted in increasing order.
For example:
get_odd_collatz(5) returns [1, 5] # The collatz sequence for 5 is [5, 16, 8, 4, 2, 1], so the odd numbers are only 1, and 5.
>>> (get_odd_collatz 5)
[1 5]"
[n]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate get_odd_collatz)
(deftest test-humaneval
(is (= (candidate 14) [1 5 7 11 13 17]))
(is (= (candidate 5) [1 5]))
(is (= (candidate 12) [1 3 5]))
(is (= (candidate 1) [1]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_124_valid_date | clj | (defn valid_date
"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 number of days is not less than 1 or higher than 30 days for months 4,6,9,11. And, the number of days is not less than 1 or higher than 29 for the month 2.
3. The months should not be less than 1 or higher than 12.
4. The date should be in the format: mm-dd-yyyy
>>> (valid_date "03-11-2000")
true
>>> (valid_date "15-01-2012")
false
>>> (valid_date "04-0-2040")
false
>>> (valid_date "06-04-2020")
true
>>> (valid_date "06/04/2020")
false"
[date]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate valid_date)
(deftest test-humaneval
(is (= (candidate "03-11-2000") true))
(is (= (candidate "15-01-2012") false))
(is (= (candidate "04-0-2040") false))
(is (= (candidate "06-04-2020") true))
(is (= (candidate "01-01-2007") true))
(is (= (candidate "03-32-2011") false))
(is (= (candidate "") false))
(is (= (candidate "04-31-3000") false))
(is (= (candidate "06-06-2005") true))
(is (= (candidate "21-31-2000") false))
(is (= (candidate "04-12-2003") true))
(is (= (candidate "04122003") false))
(is (= (candidate "20030412") false))
(is (= (candidate "2003-04") false))
(is (= (candidate "2003-04-12") false))
(is (= (candidate "04-2003") false))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_125_split_words | clj | (defn split_words
"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 world!")
["Hello" "world!"]
>>> (split_words "Hello,world!")
["Hello" "world!"]
>>> (split_words "abcdef")
3"
[txt]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate split_words)
(deftest test-humaneval
(is (= (candidate "Hello world!") ["Hello" "world!"]))
(is (= (candidate "Hello,world!") ["Hello" "world!"]))
(is (= (candidate "Hello world,!") ["Hello" "world,!"]))
(is (= (candidate "Hello,Hello,world !") ["Hello,Hello,world" "!"]))
(is (= (candidate "abcdef") 3))
(is (= (candidate "aaabb") 2))
(is (= (candidate "aaaBb") 1))
(is (= (candidate "") 0))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_126_is_sorted | clj | (defn is_sorted
"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 [1 2 3 4 5 6])
true
>>> (is_sorted [1 2 3 4 5 6 7])
true
>>> (is_sorted [1 3 2 4 5 6 7])
false
>>> (is_sorted [1 2 2 3 3 4])
true
>>> (is_sorted [1 2 2 2 3 4])
false"
[lst]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate is_sorted)
(deftest test-humaneval
(is (= (candidate [5]) true))
(is (= (candidate [1 2 3 4 5]) true))
(is (= (candidate [1 3 2 4 5]) false))
(is (= (candidate [1 2 3 4 5 6]) true))
(is (= (candidate [1 2 3 4 5 6 7]) true))
(is (= (candidate [1 3 2 4 5 6 7]) false))
(is (= (candidate []) true))
(is (= (candidate [1]) true))
(is (= (candidate [3 2 1]) false))
(is (= (candidate [1 2 2 2 3 4]) false))
(is (= (candidate [1 2 3 3 3 4]) false))
(is (= (candidate [1 2 2 3 3 4]) true))
(is (= (candidate [1 2 3 4]) true))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_127_intersection | clj | (defn intersection
"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 determine whether the length of intersection of these two
intervals is a prime number.
Example, the intersection of the intervals (1, 3), (2, 4) is (2, 3)
which its length is 1, which not a prime number.
If the length of the intersection is a prime number, return "YES",
otherwise, return "NO".
If the two intervals don't intersect, return "NO".
[input/output] samples:
>>> (intersection [1 2] [2 3])
"NO"
>>> (intersection [-1 1] [0 4])
"NO"
>>> (intersection [-3 -1] [-5 5])
"YES""
[interval1 interval2]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate intersection)
(deftest test-humaneval
(is (= (candidate [1 2] [2 3]) "NO"))
(is (= (candidate [-1 1] [0 4]) "NO"))
(is (= (candidate [-3 -1] [-5 5]) "YES"))
(is (= (candidate [-2 2] [-4 0]) "YES"))
(is (= (candidate [-11 2] [-1 -1]) "NO"))
(is (= (candidate [1 2] [3 5]) "NO"))
(is (= (candidate [1 2] [1 2]) "NO"))
(is (= (candidate [-2 -2] [-3 -2]) "NO"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_128_prod_signs | clj | (defn prod_signs
"You are given a vector arr of integers and you need to return
sum of magnitudes of integers multiplied by product of all signs
of each number in the vector, represented by 1, -1 or 0.
Note: return nil for empty arr.
Example:
>>> (prod_signs [1 2 2 -4])
9
>>> (prod_signs [0 1])
0
>>> (prod_signs [])
nil"
[arr]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate prod_signs)
(deftest test-humaneval
(is (= (candidate [1 2 2 -4]) -9))
(is (= (candidate [0 1]) 0))
(is (= (candidate [1 1 1 2 3 -1 1]) -10))
(is (= (candidate []) nil))
(is (= (candidate [2 4 1 2 -1 -1 9]) 20))
(is (= (candidate [-1 1 -1 1]) 4))
(is (= (candidate [-1 1 1 1]) -4))
(is (= (candidate [-1 1 1 0]) 0))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_129_minPath | clj | (defn minPath
"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 of length k in the grid. You can start
from any cell, and in each step you can move to any of the neighbor cells,
in other words, you can go to cells which share an edge with you current
cell.
Please note that a path of length k means visiting exactly k cells (not
necessarily distinct).
You CANNOT go off the grid.
A path A (of length k) is considered less than a path B (of length k) if
after making the ordered lists of the values on the cells that A and B go
through (let's call them lst_A and lst_B), lst_A is lexicographically less
than lst_B, in other words, there exist an integer index i (1 <= i <= k)
such that lst_A[i] < lst_B[i] and for any j (1 <= j < i) we have
lst_A[j] = lst_B[j].
It is guaranteed that the answer is unique.
Return an ordered list of the values on the cells that the minimum path go through.
Examples:
>>> (minPath [[1 2 3] [4 5 6] [7 8 9]] 3)
[1 2 1]
>>> (minPath [[5 9 3] [4 1 6] [7 8 2]] 1)
[1]"
[grid k]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate minPath)
(deftest test-humaneval
(is (= (candidate [[1 2 3] [4 5 6] [7 8 9]] 3) [1 2 1]))
(is (= (candidate [[5 9 3] [4 1 6] [7 8 2]] 1) [1]))
(is (= (candidate [[1 2 3 4] [5 6 7 8] [9 10 11 12] [13 14 15 16]] 4) [1 2 1 2]))
(is (= (candidate [[6 4 13 10] [5 7 12 1] [3 16 11 15] [8 14 9 2]] 7) [1 10 1 10 1 10 1]))
(is (= (candidate [[8 14 9 2] [6 4 13 15] [5 7 1 12] [3 10 11 16]] 5) [1 7 1 7 1]))
(is (= (candidate [[11 8 7 2] [5 16 14 4] [9 3 15 6] [12 13 10 1]] 9) [1 6 1 6 1 6 1 6 1]))
(is (= (candidate [[12 13 10 1] [9 3 15 6] [5 16 14 4] [11 8 7 2]] 12) [1 6 1 6 1 6 1 6 1 6 1 6]))
(is (= (candidate [[2 7 4] [3 1 5] [6 8 9]] 8) [1 3 1 3 1 3 1 3]))
(is (= (candidate [[6 1 5] [3 8 9] [2 7 4]] 8) [1 5 1 5 1 5 1 5]))
(is (= (candidate [[1 2] [3 4]] 10) [1 2 1 2 1 2 1 2 1 2]))
(is (= (candidate [[1 3] [3 2]] 10) [1 3 1 3 1 3 1 3 1 3]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_130_tri | clj | (defn tri
"Everyone knows Fibonacci sequence, it was studied deeply by mathematicians in
the last couple centuries. However, what people don't know is Tribonacci sequence.
Tribonacci sequence is defined by the recurrence:
tri(1) = 3
tri(n) = 1 + n / 2, if n is even.
tri(n) = tri(n - 1) + tri(n - 2) + tri(n + 1), if n is odd.
For example:
tri(2) = 1 + (2 / 2) = 2
tri(4) = 3
tri(3) = tri(2) + tri(1) + tri(4)
= 2 + 3 + 3 = 8
You are given a non-negative integer number n, you have to a return a list of the
first n + 1 numbers of the Tribonacci sequence.
Examples:
>>> (tri 3)
[1 3 2 8]"
[n]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate tri)
(deftest test-humaneval
(is (= (candidate 3) [1 3 2 8]))
(is (= (candidate 4) [1 3 2 8 3]))
(is (= (candidate 5) [1 3 2 8 3 15]))
(is (= (candidate 6) [1 3 2 8 3 15 4]))
(is (= (candidate 7) [1 3 2 8 3 15 4 24]))
(is (= (candidate 8) [1 3 2 8 3 15 4 24 5]))
(is (= (candidate 9) [1 3 2 8 3 15 4 24 5 35]))
(is (= (candidate 20) [1 3 2 8 3 15 4 24 5 35 6 48 7 63 8 80 9 99 10 120 11]))
(is (= (candidate 0) [1]))
(is (= (candidate 1) [1 3]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_131_digits | clj | (defn digits
"Given a positive integer n, return the product of the odd digits.
Return 0 if all digits are even.
For example:
>>> (digits 1)
1
>>> (digits 4)
0
>>> (digits 235)
15"
[n]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate digits)
(deftest test-humaneval
(is (= (candidate 5) 5))
(is (= (candidate 54) 5))
(is (= (candidate 120) 1))
(is (= (candidate 5014) 5))
(is (= (candidate 98765) 315))
(is (= (candidate 5576543) 2625))
(is (= (candidate 2468) 0))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_132_is_nested | clj | (defn is_nested
"Create a function that takes a string as input which contains only square brackets.
The function should return true if and only if there is a valid subsequence of brackets
where at least one bracket in the subsequence is nested.
>>> (is_nested "[[]]")
true
>>> (is_nested "[]]]]]]][[[[[]")
false
>>> (is_nested "[][]")
false
>>> (is_nested "[]")
false
>>> (is_nested "[[][]]")
true
>>> (is_nested "[[]][[")
true"
[string]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate is_nested)
(deftest test-humaneval
(is (= (candidate "[[]]") true))
(is (= (candidate "[]]]]]]][[[[[]") false))
(is (= (candidate "[][]") false))
(is (= (candidate "[]") false))
(is (= (candidate "[[[[]]]]") true))
(is (= (candidate "[]]]]]]]]]]") false))
(is (= (candidate "[][][[]]") true))
(is (= (candidate "[[]") false))
(is (= (candidate "[]]") false))
(is (= (candidate "[[]][[") true))
(is (= (candidate "[[][]]") true))
(is (= (candidate "") false))
(is (= (candidate "[[[[[[[[") false))
(is (= (candidate "]]]]]]]]") false))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_133_sum_squares | clj | (defn sum_squares
"You are given a list of numbers.
You need to return the sum of squared numbers in the given list,
round each element in the list to the upper int(Ceiling) first.
Examples:
>>> (lst [1.0 2.0 3.0])
14
>>> (lst [1.0 4.0 9.0])
98
>>> (lst [1.0 3.0 5.0 7.0])
84
>>> (lst [1.4 4.2 0.0])
29
>>> (lst [-2.4 1.0 1.0])
6"
[lst]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate sum_squares)
(deftest test-humaneval
(is (= (candidate [1.0 2.0 3.0]) 14))
(is (= (candidate [1.0 2.0 3.0]) 14))
(is (= (candidate [1.0 3.0 5.0 7.0]) 84))
(is (= (candidate [1.4 4.2 0.0]) 29))
(is (= (candidate [-2.4 1.0 1.0]) 6))
(is (= (candidate [100.0 1.0 15.0 2.0]) 10230))
(is (= (candidate [10000.0 10000.0]) 200000000))
(is (= (candidate [-1.4 4.6 6.3]) 75))
(is (= (candidate [-1.4 17.9 18.9 19.9]) 1086))
(is (= (candidate [0.0]) 0))
(is (= (candidate [-1.0]) 1))
(is (= (candidate [-1.0 1.0 0.0]) 2))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_134_check_if_last_char_is_a_letter | clj | (defn check_if_last_char_is_a_letter
"Create a function that returns true if the last character
of a given string is an alphabetical character and is not
a part of a word, and false otherwise.
Note: "word" is a group of characters separated by space.
Examples:
>>> (check_if_last_char_is_a_letter "apple pie")
false
>>> (check_if_last_char_is_a_letter "apple pi e")
true
>>> (check_if_last_char_is_a_letter "apple pi e ")
false
>>> (check_if_last_char_is_a_letter "")
false"
[txt]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate check_if_last_char_is_a_letter)
(deftest test-humaneval
(is (= (candidate "apple") false))
(is (= (candidate "apple pi e") true))
(is (= (candidate "eeeee") false))
(is (= (candidate "A") true))
(is (= (candidate "Pumpkin pie ") false))
(is (= (candidate "Pumpkin pie 1") false))
(is (= (candidate "") false))
(is (= (candidate "eeeee e ") false))
(is (= (candidate "apple pie") false))
(is (= (candidate "apple pi e ") false))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_135_can_arrange | clj | (defn can_arrange
"Create a function which returns the largest index of an element which
is not greater than or equal to the element immediately preceding it. If
no such element exists then return -1. The given vector will not contain
duplicate values.
Examples:
>>> (can_arrange [1 2 4 3 5])
3
>>> (can_arrange [1 2 3])
-1"
[arr]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate can_arrange)
(deftest test-humaneval
(is (= (candidate [1 2 4 3 5]) 3))
(is (= (candidate [1 2 4 5]) -1))
(is (= (candidate [1 4 2 5 6 7 8 9 10]) 2))
(is (= (candidate [4 8 5 7 3]) 4))
(is (= (candidate []) -1))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_136_largest_smallest_integers | clj | (defn largest_smallest_integers
"Create a function that returns a vector (a, b), where 'a' is
the largest of negative integers, and 'b' is the smallest
of positive integers in a list.
If there is no negative or positive integers, return them as nil.
Examples:
>>> (largest_smallest_integers [2 4 1 3 5 7])
[nil 1]
>>> (largest_smallest_integers [])
[nil nil]
>>> (largest_smallest_integers [0])
[nil nil]"
[lst]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate largest_smallest_integers)
(deftest test-humaneval
(is (= (candidate [2 4 1 3 5 7]) [nil 1]))
(is (= (candidate [2 4 1 3 5 7 0]) [nil 1]))
(is (= (candidate [1 3 2 4 5 6 -2]) [-2 1]))
(is (= (candidate [4 5 3 6 2 7 -7]) [-7 2]))
(is (= (candidate [7 3 8 4 9 2 5 -9]) [-9 2]))
(is (= (candidate []) [nil nil]))
(is (= (candidate [0]) [nil nil]))
(is (= (candidate [-1 -3 -5 -6]) [-1 nil]))
(is (= (candidate [-1 -3 -5 -6 0]) [-1 nil]))
(is (= (candidate [-6 -4 -4 -3 1]) [-3 1]))
(is (= (candidate [-6 -4 -4 -3 -100 1]) [-3 1]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_137_compare_one | clj | (defn compare_one
"Create a function that takes integers, floats, or strings representing
real numbers, and returns the larger variable in its given variable type.
Return nil if the values are equal.
Note: If a real number is represented as a string, the floating point might be . or ,
>>> (compare_one 1 2.5)
2.5
>>> (compare_one 1 "2,3")
"2,3"
>>> (compare_one "5,1" "6")
"6"
>>> (compare_one "1" 1)
nil"
[a b]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate compare_one)
(deftest test-humaneval
(is (= (candidate 1 2) 2))
(is (= (candidate 1 2.5) 2.5))
(is (= (candidate 2 3) 3))
(is (= (candidate 5 6) 6))
(is (= (candidate 1 "2,3") "2,3"))
(is (= (candidate "5,1" "6") "6"))
(is (= (candidate "1" "2") "2"))
(is (= (candidate "1" 1) nil))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_138_is_equal_to_sum_even | clj | (defn is_equal_to_sum_even
"Evaluate whether the given number n can be written as the sum of exactly 4 positive even numbers
Example
>>> (is_equal_to_sum_even 4)
false
>>> (is_equal_to_sum_even 6)
false
>>> (is_equal_to_sum_even 8)
true"
[n]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate is_equal_to_sum_even)
(deftest test-humaneval
(is (= (candidate 4) false))
(is (= (candidate 6) false))
(is (= (candidate 8) true))
(is (= (candidate 10) true))
(is (= (candidate 11) false))
(is (= (candidate 12) true))
(is (= (candidate 13) false))
(is (= (candidate 16) true))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_139_special_factorial | clj | (defn special_factorial
"The Brazilian factorial is defined as:
brazilian_factorial(n) = n! * (n-1)! * (n-2)! * ... * 1!
where n > 0
For example:
>>> (special_factorial 4)
288
The function will receive an integer as input and should return the special
factorial of this integer."
[n]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate special_factorial)
(deftest test-humaneval
(is (= (candidate 4) 288))
(is (= (candidate 5) 34560))
(is (= (candidate 7) 125411328000))
(is (= (candidate 1) 1))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_140_fix_spaces | clj | (defn fix_spaces
"Given a string text, replace all spaces in it with underscores,
and if a string has more than 2 consecutive spaces,
then replace all consecutive spaces with -
>>> (fix_spaces " Example")
"Example"
>>> (fix_spaces " Example 1")
"Example_1"
>>> (fix_spaces " Example 2")
"_Example_2"
>>> (fix_spaces " Example 3")
"_Example-3""
[text]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate fix_spaces)
(deftest test-humaneval
(is (= (candidate "Example") "Example"))
(is (= (candidate "Mudasir Hanif ") "Mudasir_Hanif_"))
(is (= (candidate "Yellow Yellow Dirty Fellow") "Yellow_Yellow__Dirty__Fellow"))
(is (= (candidate "Exa mple") "Exa-mple"))
(is (= (candidate " Exa 1 2 2 mple") "-Exa_1_2_2_mple"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_141_file_name_check | clj | (defn file_name_check
"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 than three digits ('0'-'9') in the file's name.
- The file's name contains exactly one dot '.'
- The substring before the dot should not be empty, and it starts with a letter from
the latin alphapet ('a'-'z' and 'A'-'Z').
- The substring after the dot should be one of these: ['txt', 'exe', 'dll']
Examples:
>>> (file_name_check "example.txt")
"Yes"
>>> (file_name_check "1example.dll")
"No""
[file_name]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate file_name_check)
(deftest test-humaneval
(is (= (candidate "example.txt") "Yes"))
(is (= (candidate "1example.dll") "No"))
(is (= (candidate "s1sdf3.asd") "No"))
(is (= (candidate "K.dll") "Yes"))
(is (= (candidate "MY16FILE3.exe") "Yes"))
(is (= (candidate "His12FILE94.exe") "No"))
(is (= (candidate "_Y.txt") "No"))
(is (= (candidate "?aREYA.exe") "No"))
(is (= (candidate "/this_is_valid.dll") "No"))
(is (= (candidate "this_is_valid.wow") "No"))
(is (= (candidate "this_is_valid.txt") "Yes"))
(is (= (candidate "this_is_valid.txtexe") "No"))
(is (= (candidate "#this2_i4s_5valid.ten") "No"))
(is (= (candidate "@this1_is6_valid.exe") "No"))
(is (= (candidate "this_is_12valid.6exe4.txt") "No"))
(is (= (candidate "all.exe.txt") "No"))
(is (= (candidate "I563_No.exe") "Yes"))
(is (= (candidate "Is3youfault.txt") "Yes"))
(is (= (candidate "no_one#knows.dll") "Yes"))
(is (= (candidate "1I563_Yes3.exe") "No"))
(is (= (candidate "I563_Yes3.txtt") "No"))
(is (= (candidate "final..txt") "No"))
(is (= (candidate "final132") "No"))
(is (= (candidate "_f4indsartal132.") "No"))
(is (= (candidate ".txt") "No"))
(is (= (candidate "s.") "No"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_142_sum_squares | clj | (defn sum_squares
""
This function will take a list of integers. For all entries in the list, the function shall square the integer entry if its index is a
multiple of 3 and will cube the integer entry if its index is a multiple of 4 and not a multiple of 3. The function will not
change the entries in the list whose indexes are not a multiple of 3 or 4. The function shall then return the sum of all entries.
Examples:
>>> lst
[1 2 3]
>>> lst
[]
>>> lst
[-1 -5 2 -1 -5]"
[lst]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate sum_squares)
(deftest test-humaneval
(is (= (candidate [1 2 3]) 6))
(is (= (candidate [1 4 9]) 14))
(is (= (candidate []) 0))
(is (= (candidate [1 1 1 1 1 1 1 1 1]) 9))
(is (= (candidate [-1 -1 -1 -1 -1 -1 -1 -1 -1]) -3))
(is (= (candidate [0]) 0))
(is (= (candidate [-1 -5 2 -1 -5]) -126))
(is (= (candidate [-56 -99 1 0 -2]) 3030))
(is (= (candidate [-1 0 0 0 0 0 0 0 -1]) 0))
(is (= (candidate [-16 -9 -2 36 36 26 -20 25 -40 20 -4 12 -26 35 37]) -14196))
(is (= (candidate [-1 -3 17 -1 -15 13 -1 14 -14 -12 -5 14 -14 6 13 11 16 16 4 10]) -1448))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_143_words_in_sentence | clj | (defn words_in_sentence
"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 be the same as the original one.
Example 1:
>>> (words_in_sentence "This is a test")
"is"
Example 2:
>>> (words_in_sentence "lets go for swimming")
"go for"
Constraints:
* 1 <= len(sentence) <= 100
* sentence contains only letters"
[sentence]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate words_in_sentence)
(deftest test-humaneval
(is (= (candidate "This is a test") "is"))
(is (= (candidate "lets go for swimming") "go for"))
(is (= (candidate "there is no place available here") "there is no place"))
(is (= (candidate "Hi I am Hussein") "Hi am Hussein"))
(is (= (candidate "go for it") "go for it"))
(is (= (candidate "here") ""))
(is (= (candidate "here is") "is"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_144_simplify | clj | (defn simplify
"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> where both numerator and denominator are positive whole numbers.
You can assume that x, and n are valid fractions, and do not have zero as denominator.
>>> (simplify "1/5" "5/1")
true
>>> (simplify "1/6" "2/1")
false
>>> (simplify "7/10" "10/2")
false"
[x n]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate simplify)
(deftest test-humaneval
(is (= (candidate "1/5" "5/1") true))
(is (= (candidate "1/6" "2/1") false))
(is (= (candidate "5/1" "3/1") true))
(is (= (candidate "7/10" "10/2") false))
(is (= (candidate "2/10" "50/10") true))
(is (= (candidate "7/2" "4/2") true))
(is (= (candidate "11/6" "6/1") true))
(is (= (candidate "2/3" "5/2") false))
(is (= (candidate "5/2" "3/5") false))
(is (= (candidate "2/4" "8/4") true))
(is (= (candidate "2/4" "4/2") true))
(is (= (candidate "1/5" "5/1") true))
(is (= (candidate "1/5" "1/5") false))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_145_order_by_points | clj | (defn order_by_points
"Write a function which sorts the given list of integers
in ascending order according to the sum of their digits.
Note: if there are several items with similar sum of their digits,
order them based on their index in original list.
For example:
>>> (order_by_points [1 11 -1 -11 -12])
[-1 -11 1 -12 11]
>>> (order_by_points [])
[]"
[nums]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate order_by_points)
(deftest test-humaneval
(is (= (candidate [1 11 -1 -11 -12]) [-1 -11 1 -12 11]))
(is (= (candidate [1234 423 463 145 2 423 423 53 6 37 3457 3 56 0 46]) [0 2 3 6 53 423 423 423 1234 145 37 46 56 463 3457]))
(is (= (candidate []) []))
(is (= (candidate [1 -11 -32 43 54 -98 2 -3]) [-3 -32 -98 -11 1 2 43 54]))
(is (= (candidate [1 2 3 4 5 6 7 8 9 10 11]) [1 10 2 11 3 4 5 6 7 8 9]))
(is (= (candidate [0 6 6 -76 -21 23 4]) [-76 -21 0 4 23 6 6]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_146_specialFilter | clj | (defn specialFilter
"Write a function that takes a vector of numbers as input and returns
the number of elements in the vector that are greater than 10 and both
first and last digits of a number are odd (1, 3, 5, 7, 9).
For example:
>>> (specialFilter [15 -73 14 -15])
1
>>> (specialFilter [33 -2 -3 45 21 109])
2"
[nums]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate specialFilter)
(deftest test-humaneval
(is (= (candidate [5 -2 1 -5]) 0))
(is (= (candidate [15 -73 14 -15]) 1))
(is (= (candidate [33 -2 -3 45 21 109]) 2))
(is (= (candidate [43 -12 93 125 121 109]) 4))
(is (= (candidate [71 -2 -33 75 21 19]) 3))
(is (= (candidate [1]) 0))
(is (= (candidate []) 0))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_147_get_max_triples | clj | (defn get_max_triples
" You are given a positive integer n. You have to create an integer vector 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.
Example :
>>> (get_max_triples 5)
1
Explanation:
a = [1, 3, 7, 13, 21]
The only valid triple is (1, 7, 13)."
[n]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate get_max_triples)
(deftest test-humaneval
(is (= (candidate 5) 1))
(is (= (candidate 6) 4))
(is (= (candidate 10) 36))
(is (= (candidate 100) 53361))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_148_bf | clj | (defn bf
"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 vector containing all planets whose orbits are
located between the orbit of planet1 and the orbit of planet2, sorted by
the proximity to the sun.
The function should return an empty vector if planet1 or planet2
are not correct planet names.
Examples
>>> (bf "Jupiter" "Neptune")
["Saturn" "Uranus"]
>>> (bf "Earth" "Mercury")
"Venus"
>>> (bf "Mercury" "Uranus")
["Venus" "Earth" "Mars" "Jupiter" "Saturn"]"
[planet1 planet2]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate bf)
(deftest test-humaneval
(is (= (candidate "Jupiter" "Neptune") ["Saturn" "Uranus"]))
(is (= (candidate "Earth" "Mercury") ["Venus"]))
(is (= (candidate "Mercury" "Uranus") ["Venus" "Earth" "Mars" "Jupiter" "Saturn"]))
(is (= (candidate "Neptune" "Venus") ["Earth" "Mars" "Jupiter" "Saturn" "Uranus"]))
(is (= (candidate "Earth" "Earth") []))
(is (= (candidate "Mars" "Earth") []))
(is (= (candidate "Jupiter" "Makemake") []))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_149_sorted_list_sum | clj | (defn sorted_list_sum
"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 a vector of numbers,
and it may contain duplicates.
The order of the list should be ascending by length of each word, and you
should return the list sorted by that rule.
If two words have the same length, sort the list alphabetically.
The function should return a list of strings in sorted order.
You may assume that all words will have the same length.
For example:
>>> (list_sort ["aa" "a" "aaa"])
["aa"]
>>> (list_sort ["ab" "a" "aaa" "cd"])
["ab" "cd"]"
[lst]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate sorted_list_sum)
(deftest test-humaneval
(is (= (candidate ["aa" "a" "aaa"]) ["aa"]))
(is (= (candidate ["school" "AI" "asdf" "b"]) ["AI" "asdf" "school"]))
(is (= (candidate ["d" "b" "c" "a"]) []))
(is (= (candidate ["d" "dcba" "abcd" "a"]) ["abcd" "dcba"]))
(is (= (candidate ["AI" "ai" "au"]) ["AI" "ai" "au"]))
(is (= (candidate ["a" "b" "b" "c" "c" "a"]) []))
(is (= (candidate ["aaaa" "bbbb" "dd" "cc"]) ["cc" "dd" "aaaa" "bbbb"]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_150_x_or_y | clj | (defn x_or_y
"A simple program which should return the value of x if n is
a prime number and should return the value of y otherwise.
Examples:
>>> (x_or_y 7 34 12)
34
>>> (x_or_y 15 8 5)
5"
[n x y]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate x_or_y)
(deftest test-humaneval
(is (= (candidate 7 34 12) 34))
(is (= (candidate 15 8 5) 5))
(is (= (candidate 3 33 5212) 33))
(is (= (candidate 1259 3 52) 3))
(is (= (candidate 7919 -1 12) -1))
(is (= (candidate 3609 1245 583) 583))
(is (= (candidate 91 56 129) 129))
(is (= (candidate 6 34 1234) 1234))
(is (= (candidate 1 2 0) 0))
(is (= (candidate 2 2 0) 2))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_151_double_the_difference | clj | (defn double_the_difference
"Given a list of numbers, return the sum of squares of the numbers
in the list that are odd. Ignore numbers that are negative or not integers.
>>> (double_the_difference [1 3 2 0])
10
>>> (double_the_difference [-1 -2 0])
0
>>> (double_the_difference [9 -2])
81
>>> (double_the_difference [0])
0
If the input list is empty, return 0."
[lst]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate double_the_difference)
(deftest test-humaneval
(is (= (candidate []) 0))
(is (= (candidate [5.0 4.0]) 25))
(is (= (candidate [0.1 0.2 0.3]) 0))
(is (= (candidate [-10.0 -20.0 -30.0]) 0))
(is (= (candidate [-1.0 -2.0 8.0]) 0))
(is (= (candidate [0.2 3.0 5.0]) 34))
(is (= (candidate [-9.0 -7.0 -5.0 -3.0 -1.0 1.0 3.0 5.0 7.0 9.0]) 165))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_152_compare | clj | (defn compare
"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 the results of a number of matches.
You are given two vectors of scores and guesses of equal length, where each index shows a match.
Return a vector of the same length denoting how far off each guess was. If they have guessed correctly,
the value is 0, and if not, the value is the absolute difference between the guess and the score.
example:
>>> (compare [1 2 3 4 5 1] [1 2 3 4 2 -2])
[0 0 0 0 3 3]
>>> (compare [0 5 0 0 0 4] [4 1 1 0 0 -2])
[4 4 1 0 0 6]"
[game guess]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate compare)
(deftest test-humaneval
(is (= (candidate [1 2 3 4 5 1] [1 2 3 4 2 -2]) [0 0 0 0 3 3]))
(is (= (candidate [0 0 0 0 0 0] [0 0 0 0 0 0]) [0 0 0 0 0 0]))
(is (= (candidate [1 2 3] [-1 -2 -3]) [2 4 6]))
(is (= (candidate [1 2 3 5] [-1 2 3 4]) [2 0 0 1]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_153_Strongest_Extension | clj | (defn Strongest_Extension
"You will be given the name of a class (a string) and a list of extensions.
The extensions are to be used to load additional classes to the class. The
strength of the extension is as follows: Let CAP be the number of the uppercase
letters in the extension's name, and let SM be the number of lowercase letters
in the extension's name, the strength is given by the fraction CAP - SM.
You should find the strongest extension and return a string in this
format: ClassName.StrongestExtensionName.
If there are two or more extensions with the same strength, you should
choose the one that comes first in the list.
For example, if you are given "Slices" as the class and a list of the
extensions: ['SErviNGSliCes', 'Cheese', 'StuFfed'] then you should
return 'Slices.SErviNGSliCes' since 'SErviNGSliCes' is the strongest extension
(its strength is -1).
Example:
>>> (Strongest_Extension "my_class" ["AA" "Be" "CC"])
"my_class.AA""
[class_name extensions]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate Strongest_Extension)
(deftest test-humaneval
(is (= (candidate "Watashi" ["tEN" "niNE" "eIGHt8OKe"]) "Watashi.eIGHt8OKe"))
(is (= (candidate "Boku123" ["nani" "NazeDa" "YEs.WeCaNe" "32145tggg"]) "Boku123.YEs.WeCaNe"))
(is (= (candidate "__YESIMHERE" ["t" "eMptY" "nothing" "zeR00" "NuLl__" "123NoooneB321"]) "__YESIMHERE.NuLl__"))
(is (= (candidate "K" ["Ta" "TAR" "t234An" "cosSo"]) "K.TAR"))
(is (= (candidate "__HAHA" ["Tab" "123" "781345" "-_-"]) "__HAHA.123"))
(is (= (candidate "YameRore" ["HhAas" "okIWILL123" "WorkOut" "Fails" "-_-"]) "YameRore.okIWILL123"))
(is (= (candidate "finNNalLLly" ["Die" "NowW" "Wow" "WoW"]) "finNNalLLly.WoW"))
(is (= (candidate "_" ["Bb" "91245"]) "_.Bb"))
(is (= (candidate "Sp" ["671235" "Bb"]) "Sp.671235"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_154_cycpattern_check | clj | (defn cycpattern_check
"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
>>> (cycpattern_check "abcd" "abd")
false
>>> (cycpattern_check "hello" "ell")
true
>>> (cycpattern_check "whassup" "psus")
false
>>> (cycpattern_check "abab" "baa")
true
>>> (cycpattern_check "efef" "eeff")
false
>>> (cycpattern_check "himenss" "simen")
true"
[a b]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate cycpattern_check)
(deftest test-humaneval
(is (= (candidate "xyzw" "xyw") false))
(is (= (candidate "yello" "ell") true))
(is (= (candidate "whattup" "ptut") false))
(is (= (candidate "efef" "fee") true))
(is (= (candidate "abab" "aabb") false))
(is (= (candidate "winemtt" "tinem") true))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_155_even_odd_count | clj | (defn even_odd_count
"Given an integer. return a vector that has the number of even and odd digits respectively.
Example:
>>> (even_odd_count -12)
[1 1]
>>> (even_odd_count 123)
[1 2]"
[num]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate even_odd_count)
(deftest test-humaneval
(is (= (candidate 7) [0 1]))
(is (= (candidate -78) [1 1]))
(is (= (candidate 3452) [2 2]))
(is (= (candidate 346211) [3 3]))
(is (= (candidate -345821) [3 3]))
(is (= (candidate -2) [1 0]))
(is (= (candidate -45347) [2 3]))
(is (= (candidate 0) [1 0]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_156_int_to_mini_roman | clj | (defn int_to_mini_roman
"Given a positive integer, obtain its roman numeral equivalent as a string,
and return it in lowercase.
Restrictions: 1 <= num <= 1000
Examples:
>>> (int_to_mini_roman 19)
"xix"
>>> (int_to_mini_roman 152)
"clii"
>>> (int_to_mini_roman 426)
"cdxxvi""
[number]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate int_to_mini_roman)
(deftest test-humaneval
(is (= (candidate 19) "xix"))
(is (= (candidate 152) "clii"))
(is (= (candidate 251) "ccli"))
(is (= (candidate 426) "cdxxvi"))
(is (= (candidate 500) "d"))
(is (= (candidate 1) "i"))
(is (= (candidate 4) "iv"))
(is (= (candidate 43) "xliii"))
(is (= (candidate 90) "xc"))
(is (= (candidate 94) "xciv"))
(is (= (candidate 532) "dxxxii"))
(is (= (candidate 900) "cm"))
(is (= (candidate 994) "cmxciv"))
(is (= (candidate 1000) "m"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_157_right_angle_triangle | clj | (defn right_angle_triangle
"Given the lengths of the three sides of a triangle. Return true if the three
sides form a right-angled triangle, false otherwise.
A right-angled triangle is a triangle in which one angle is right angle or
90 degree.
Example:
>>> (right_angle_triangle 3 4 5)
true
>>> (right_angle_triangle 1 2 3)
false"
[a b c]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate right_angle_triangle)
(deftest test-humaneval
(is (= (candidate 3 4 5) true))
(is (= (candidate 1 2 3) false))
(is (= (candidate 10 6 8) true))
(is (= (candidate 2 2 2) false))
(is (= (candidate 7 24 25) true))
(is (= (candidate 10 5 7) false))
(is (= (candidate 5 12 13) true))
(is (= (candidate 15 8 17) true))
(is (= (candidate 48 55 73) true))
(is (= (candidate 1 1 1) false))
(is (= (candidate 2 2 10) false))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_158_find_max | clj | (defn find_max
"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.
>>> (find_max ["name" "of" "string"])
"string"
>>> (find_max ["name" "enam" "game"])
"enam"
>>> (find_max ["aaaaaaa" "bb" "cc"])
"aaaaaaa""
[words]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate find_max)
(deftest test-humaneval
(is (= (candidate ["name" "of" "string"]) "string"))
(is (= (candidate ["name" "enam" "game"]) "enam"))
(is (= (candidate ["aaaaaaa" "bb" "cc"]) "aaaaaaa"))
(is (= (candidate ["abc" "cba"]) "abc"))
(is (= (candidate ["play" "this" "game" "of" "footbott"]) "footbott"))
(is (= (candidate ["we" "are" "gonna" "rock"]) "gonna"))
(is (= (candidate ["we" "are" "a" "mad" "nation"]) "nation"))
(is (= (candidate ["this" "is" "a" "prrk"]) "this"))
(is (= (candidate ["b"]) "b"))
(is (= (candidate ["play" "play" "play"]) "play"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_159_eat | clj | (defn eat
"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 a vector of [ total number of eaten carrots after your meals,
the number of carrots left after your meals ]
if there are not enough remaining carrots, you will eat all remaining carrots, but will still be hungry.
Example:
>>> (eat 5 6 10)
[11 4]
>>> (eat 4 8 9)
[12 1]
>>> (eat 1 10 10)
[11 0]
>>> (eat 2 11 5)
[7 0]
Variables:
@number : integer
the number of carrots that you have eaten.
@need : integer
the number of carrots that you need to eat.
@remaining : integer
the number of remaining carrots thet exist in stock
Constrain:
* 0 <= number <= 1000
* 0 <= need <= 1000
* 0 <= remaining <= 1000
Have fun :)"
[number need remaining]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate eat)
(deftest test-humaneval
(is (= (candidate 5 6 10) [11 4]))
(is (= (candidate 4 8 9) [12 1]))
(is (= (candidate 1 10 10) [11 0]))
(is (= (candidate 2 11 5) [7 0]))
(is (= (candidate 4 5 7) [9 2]))
(is (= (candidate 4 5 1) [5 0]))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_160_do_algebra | clj | (defn do_algebra
"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 operations:
Addition ( + )
Subtraction ( - )
Multiplication ( * )
Floor division ( // )
Exponentiation ( ** )
Example:
operator['+', '*', '-']
vector = [2, 3, 4, 5]
result = 2 + 3 * 4 - 5
=> result = 9
Note:
The length of operator list is equal to the length of operand list minus one.
Operand is a list of of non-negative integers.
Operator list has at least one operator, and operand list has at least two operands."
[operator operand]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate do_algebra)
(deftest test-humaneval
(is (= (candidate ["**" "*" "+"] [2 3 4 5]) 37))
(is (= (candidate ["+" "*" "-"] [2 3 4 5]) 9))
(is (= (candidate ["//" "*"] [7 3 4]) 8))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_161_solve | clj | (defn solve
"You are given a string s.
if s[i] is a letter, reverse its case from lower to upper or vise versa,
otherwise keep it as it is.
If the string contains no letters, reverse the string.
The function should return the resulted string.
Examples
>>> (solve "1234")
"4321"
>>> (solve "ab")
"AB"
>>> (solve "#a@C")
"#A@c""
[s]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate solve)
(deftest test-humaneval
(is (= (candidate "AsDf") "aSdF"))
(is (= (candidate "1234") "4321"))
(is (= (candidate "ab") "AB"))
(is (= (candidate "#a@C") "#A@c"))
(is (= (candidate "#AsdfW^45") "#aSDFw^45"))
(is (= (candidate "#6@2") "2@6#"))
(is (= (candidate "#$a^D") "#$A^d"))
(is (= (candidate "#ccc") "#CCC"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_162_string_to_md5 | clj | (defn string_to_md5
"Given a string 'text', return its md5 hash equivalent string.
If 'text' is an empty string, return nil.
>>> (string_to_md5 "Hello world")
"3e25960a79dbc69b674cd4ec67a72c62""
[text]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate string_to_md5)
(deftest test-humaneval
(is (= (candidate "Hello world") "3e25960a79dbc69b674cd4ec67a72c62"))
(is (= (candidate "") nil))
(is (= (candidate "A B C") "0ef78513b0cb8cef12743f5aeb35f888"))
(is (= (candidate "password") "5f4dcc3b5aa765d61d8327deb882cf99"))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |
HumanEval_163_generate_integers | clj | (defn generate_integers
"Given two positive integers a and b, return the even digits between a
and b, in ascending order.
For example:
>>> (generate_integers 2 8)
[2 4 6 8]
>>> (generate_integers 8 2)
[2 4 6 8]
>>> (generate_integers 10 14)
[]"
[a b]
| transform | reworded | (require '[clojure.test :refer [deftest is run-test]])
(def candidate generate_integers)
(deftest test-humaneval
(is (= (candidate 2 10) [2 4 6 8]))
(is (= (candidate 10 2) [2 4 6 8]))
(is (= (candidate 132 2) [2 4 6 8]))
(is (= (candidate 17 89) []))
)
(run-test test-humaneval) | [
"\n(def",
"\n;",
"\n("
] |