task_id stringlengths 9 10 | prompt stringlengths 133 1.16k | canonical_solution stringlengths 24 891 | entry_point stringlengths 3 25 | test stringlengths 3.51k 147M |
|---|---|---|---|---|
EvoEval/0 |
from typing import List
def has_close_elements(numbers: List[float], threshold: float) -> bool:
""" Check if in given list of numbers, are any two adjacent numbers closer to each other than
given threshold.
>>> has_close_elements([1.0, 2.0, 3.0], 0.5)
False
>>> has_close_elements([1.0, 2.8, 3.0, ... |
for i in range(len(numbers) - 1):
if abs(numbers[i + 1] - numbers[i]) < threshold:
return True
return False
| has_close_elements |
import numpy as np
from numpy import nan, inf # for some outputs.
import sys
sys.set_int_max_str_digits(0)
from enum import IntEnum, auto
def is_floats(x) -> bool:
# check if it is float; List[float]; Tuple[float]
# TODO: search for any close floats? (other data structures)
if isinstance(x, float):
... |
EvoEval/1 | "from typing import List\n\n\ndef separate_paren_groups(paren_string: str) -> List[str]:\n \"\"\"(...TRUNCATED) | "\n\n\n cnt, group, results = 0, \"\", []\n for ch in paren_string:\n if ch == \"(\": c(...TRUNCATED) | separate_paren_groups | "\nimport numpy as np\nfrom numpy import nan, inf # for some outputs.\nimport sys\n\nsys.set_int_max(...TRUNCATED) |
EvoEval/2 | "\ndef truncate_number(number: float) -> float:\n \"\"\" Given a positive floating point number, (...TRUNCATED) |
return int(number), number - int(number)
| truncate_number | "\nimport numpy as np\nfrom numpy import nan, inf # for some outputs.\nimport sys\n\nsys.set_int_max(...TRUNCATED) |
EvoEval/3 | "\nfrom typing import List\n\n\ndef below_one(operations: List[int]) -> bool:\n \"\"\" You're giv(...TRUNCATED) | "\n\n account = 1\n for operation in operations:\n account += operation\n if acc(...TRUNCATED) | below_one | "\nimport numpy as np\nfrom numpy import nan, inf # for some outputs.\nimport sys\n\nsys.set_int_max(...TRUNCATED) |
EvoEval/4 | "\nfrom typing import List\n\n\ndef median_absolute_deviation(numbers: List[float]) -> float:\n \(...TRUNCATED) | "\n def median(sorted_lst):\n return sorted_lst[len(sorted_lst) // 2] if len(sorted_lst) %(...TRUNCATED) | median_absolute_deviation | "\nimport numpy as np\nfrom numpy import nan, inf # for some outputs.\nimport sys\n\nsys.set_int_max(...TRUNCATED) |
EvoEval/5 | "\nfrom typing import List\n\n\ndef intersperse(numbers: List[int], delimeter: int) -> List[int]:\n (...TRUNCATED) | "\n\n\n\n res = []\n for i in range(len(numbers)):\n res.append(numbers[i])\n if(...TRUNCATED) | intersperse | "\nimport numpy as np\nfrom numpy import nan, inf # for some outputs.\nimport sys\n\nsys.set_int_max(...TRUNCATED) |
EvoEval/6 | "\nfrom typing import List\n\n\ndef parse_nested_parens(paren_string: str) -> List[int]:\n \"\"\"(...TRUNCATED) | "\n\n \n def count_depth(s: str) -> int:\n max_depth, cnt = 0, 0\n for ch in s:\(...TRUNCATED) | parse_nested_parens | "\nimport numpy as np\nfrom numpy import nan, inf # for some outputs.\nimport sys\n\nsys.set_int_max(...TRUNCATED) |
EvoEval/7 | "\nfrom typing import List\n\n\ndef filter_by_substring(strings: List[str], substring: str) -> List[(...TRUNCATED) |
return list(filter(lambda s: substring not in s, strings))
| filter_by_substring | "\nimport numpy as np\nfrom numpy import nan, inf # for some outputs.\nimport sys\n\nsys.set_int_max(...TRUNCATED) |
EvoEval/8 | "\nfrom typing import List, Tuple\n\n\ndef sum_product(numbers: List[int]) -> Tuple[int, int]:\n (...TRUNCATED) | "\n\n\n s, p = 0, 1\n for number in numbers:\n if number >= 0:\n s += number(...TRUNCATED) | sum_product | "\nimport numpy as np\nfrom numpy import nan, inf # for some outputs.\nimport sys\n\nsys.set_int_max(...TRUNCATED) |
EvoEval/9 | "\nfrom typing import List, Tuple\n\n\ndef rolling_min(numbers: List[int]) -> List[int]:\n \"\"\"(...TRUNCATED) |
return [min(numbers[:(i+1)]) for i in range(len(numbers))]
| rolling_min | "\nimport numpy as np\nfrom numpy import nan, inf # for some outputs.\nimport sys\n\nsys.set_int_max(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 6