sample_id stringlengths 21 196 | text stringlengths 105 936k | metadata dict | category stringclasses 6
values |
|---|---|---|---|
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/67.py | def fruit_distribution(s,n):
"""
In this task, you will be given a string that represents a number of apples and oranges
that are distributed in a basket of fruit this basket contains
apples, oranges, and mango fruits. Given the string that represents the total number of
the oranges and apples and an integer that represent the total number of the fruits
in the basket return the number of the mango fruits in the basket.
for examble:
fruit_distribution("5 apples and 6 oranges", 19) ->19 - 5 - 6 = 8
fruit_distribution("0 apples and 1 oranges",3) -> 3 - 0 - 1 = 2
fruit_distribution("2 apples and 3 oranges", 100) -> 100 - 2 - 3 = 95
fruit_distribution("100 apples and 1 oranges",120) -> 120 - 100 - 1 = 19
"""
words = s.split()
numbers = [int(word) for word in words if word.isdigit()]
return n - sum(numbers) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/67.py",
"license": "MIT License",
"lines": 16,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/68.py | def pluck(arr):
"""
"Given an array representing a branch of a tree that has non-negative integer nodes
your task is to pluck one of the nodes and return it.
The plucked node should be the node with the smallest even value.
If multiple nodes with the same smallest even value are found return the node that has smallest index.
The plucked node should be returned in a list, [ smalest_value, its index ],
If there are no even values or the given array is empty, return [].
Example 1:
Input: [4,2,3]
Output: [2, 1]
Explanation: 2 has the smallest even value, and 2 has the smallest index.
Example 2:
Input: [1,2,3]
Output: [2, 1]
Explanation: 2 has the smallest even value, and 2 has the smallest index.
Example 3:
Input: []
Output: []
Example 4:
Input: [5, 0, 3, 0, 4, 2]
Output: [0, 1]
Explanation: 0 is the smallest value, but there are two zeros,
so we will choose the first zero, which has the smallest index.
Constraints:
* 1 <= nodes.length <= 10000
* 0 <= node.value
"""
if not arr:
return []
smallest_even = None
smallest_index = None
for i, val in enumerate(arr):
if val % 2 == 0:
if smallest_even is None or val < smallest_even:
smallest_even = val
smallest_index = i
if smallest_even is None:
return []
return [smallest_even, smallest_index] | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/68.py",
"license": "MIT License",
"lines": 40,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/69.py | def search(lst):
'''
You are given a non-empty list of positive integers. Return the greatest integer that is greater than
zero, and has a frequency greater than or equal to the value of the integer itself.
The frequency of an integer is the number of times it appears in the list.
If no such a value exist, return -1.
Examples:
search([4, 1, 2, 2, 3, 1]) == 2
search([1, 2, 2, 3, 3, 3, 4, 4, 4]) == 3
search([5, 5, 4, 4, 4]) == -1
'''
from collections import Counter
freq = Counter(lst)
result = -1
for num, count in freq.items():
if num > 0 and count >= num:
result = max(result, num)
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/69.py",
"license": "MIT License",
"lines": 18,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/7.py | from typing import List
def filter_by_substring(strings: List[str], substring: str) -> List[str]:
""" Filter an input list of strings only for ones that contain given substring
>>> filter_by_substring([], 'a')
[]
>>> filter_by_substring(['abc', 'bacd', 'cde', 'array'], 'a')
['abc', 'bacd', 'array']
"""
return [s for s in strings if substring in s] | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/7.py",
"license": "MIT License",
"lines": 9,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/70.py | def strange_sort_list(lst):
'''
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:
strange_sort_list([1, 2, 3, 4]) == [1, 4, 2, 3]
strange_sort_list([5, 5, 5, 5]) == [5, 5, 5, 5]
strange_sort_list([]) == []
'''
if not lst:
return []
sorted_lst = sorted(lst)
result = []
take_min = True
while sorted_lst:
if take_min:
result.append(sorted_lst.pop(0))
else:
result.append(sorted_lst.pop())
take_min = not take_min
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/70.py",
"license": "MIT License",
"lines": 22,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/71.py | def triangle_area(a, b, c):
'''
Given the lengths of the three sides of a triangle. Return the area of
the triangle rounded to 2 decimal points if the three sides form a valid triangle.
Otherwise return -1
Three sides make a valid triangle when the sum of any two sides is greater
than the third side.
Example:
triangle_area(3, 4, 5) == 6.00
triangle_area(1, 2, 10) == -1
'''
if a + b <= c or a + c <= b or b + c <= a:
return -1
s = (a + b + c) / 2
area = (s * (s - a) * (s - b) * (s - c)) ** 0.5
return round(area, 2) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/71.py",
"license": "MIT License",
"lines": 16,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/72.py | def will_it_fly(q,w):
'''
Write a function that returns True if the object q will fly, and False otherwise.
The object q will fly if it's balanced (it is a palindromic list) and the sum of its elements is less than or equal the maximum possible weight w.
Example:
will_it_fly([1, 2], 5) ➞ False
# 1+2 is less than the maximum possible weight, but it's unbalanced.
will_it_fly([3, 2, 3], 1) ➞ False
# it's balanced, but 3+2+3 is more than the maximum possible weight.
will_it_fly([3, 2, 3], 9) ➞ True
# 3+2+3 is less than the maximum possible weight, and it's balanced.
will_it_fly([3], 5) ➞ True
# 3 is less than the maximum possible weight, and it's balanced.
'''
is_balanced = q == q[::-1]
is_light_enough = sum(q) <= w
return is_balanced and is_light_enough | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/72.py",
"license": "MIT License",
"lines": 17,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/73.py | def smallest_change(arr):
"""
Given an array arr of integers, find the minimum number of elements that
need to be changed to make the array palindromic. A palindromic array is an array that
is read the same backwards and forwards. In one change, you can change one element to any other element.
For example:
smallest_change([1,2,3,5,4,7,9,6]) == 4
smallest_change([1, 2, 3, 4, 3, 2, 2]) == 1
smallest_change([1, 2, 3, 2, 1]) == 0
"""
changes = 0
n = len(arr)
for i in range(n // 2):
if arr[i] != arr[n - 1 - i]:
changes += 1
return changes | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/73.py",
"license": "MIT License",
"lines": 16,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/74.py | def total_match(lst1, lst2):
'''
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
total_match([], []) ➞ []
total_match(['hi', 'admin'], ['hI', 'Hi']) ➞ ['hI', 'Hi']
total_match(['hi', 'admin'], ['hi', 'hi', 'admin', 'project']) ➞ ['hi', 'admin']
total_match(['hi', 'admin'], ['hI', 'hi', 'hi']) ➞ ['hI', 'hi', 'hi']
total_match(['4'], ['1', '2', '3', '4', '5']) ➞ ['4']
'''
total1 = sum(len(s) for s in lst1)
total2 = sum(len(s) for s in lst2)
if total1 <= total2:
return lst1
else:
return lst2 | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/74.py",
"license": "MIT License",
"lines": 18,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/75.py | def is_multiply_prime(a):
"""Write a function that returns true if the given number is the multiplication of 3 prime numbers
and false otherwise.
Knowing that (a) is less then 100.
Example:
is_multiply_prime(30) == True
30 = 2 * 3 * 5
"""
def is_prime(n):
if n < 2:
return False
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
return False
return True
primes = [i for i in range(2, 100) if is_prime(i)]
for i in primes:
if i > a:
break
if a % i == 0:
for j in primes:
if i * j > a:
break
if a % (i * j) == 0:
k = a // (i * j)
if is_prime(k):
return True
return False | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/75.py",
"license": "MIT License",
"lines": 28,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_complex |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/76.py | def is_simple_power(x, n):
"""Your task is to write a function that returns true if a number x is a simple
power of n and false in other cases.
x is a simple power of n if n**int=x
For example:
is_simple_power(1, 4) => true
is_simple_power(2, 2) => true
is_simple_power(8, 2) => true
is_simple_power(3, 2) => false
is_simple_power(3, 1) => false
is_simple_power(5, 3) => false
"""
if x == 1:
return True
if n == 1:
return False
power = 1
while power < x:
power *= n
return power == x | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/76.py",
"license": "MIT License",
"lines": 20,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/77.py | def iscube(a):
'''
Write a function that takes an integer a and returns True
if this ingeger is a cube of some integer number.
Note: you may assume the input is always valid.
Examples:
iscube(1) ==> True
iscube(2) ==> False
iscube(-1) ==> True
iscube(64) ==> True
iscube(0) ==> True
iscube(180) ==> False
'''
if a == 0:
return True
cube_root = round(abs(a) ** (1/3))
return cube_root ** 3 == abs(a) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/77.py",
"license": "MIT License",
"lines": 17,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/78.py | def hex_key(num):
"""You have been tasked to write a function that receives
a hexadecimal number as a string and counts the number of hexadecimal
digits that are primes (prime number, or a prime, is a natural number
greater than 1 that is not a product of two smaller natural numbers).
Hexadecimal digits are 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, A, B, C, D, E, F.
Prime numbers are 2, 3, 5, 7, 11, 13, 17,...
So you have to determine a number of the following digits: 2, 3, 5, 7,
B (=decimal 11), D (=decimal 13).
Note: you may assume the input is always correct or empty string,
and symbols A,B,C,D,E,F are always uppercase.
Examples:
For num = "AB" the output should be 1.
For num = "1077E" the output should be 2.
For num = "ABED1A33" the output should be 4.
For num = "123456789ABCDEF0" the output should be 6.
For num = "2020" the output should be 2.
"""
prime_hex_digits = {'2', '3', '5', '7', 'B', 'D'}
count = 0
for digit in num:
if digit in prime_hex_digits:
count += 1
return count | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/78.py",
"license": "MIT License",
"lines": 24,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/79.py | def decimal_to_binary(decimal):
"""You will be given a number in decimal form and your task is to convert it to
binary format. The function should return a string, with each character representing a binary
number. Each character in the string will be '0' or '1'.
There will be an extra couple of characters 'db' at the beginning and at the end of the string.
The extra characters are there to help with the format.
Examples:
decimal_to_binary(15) # returns "db1111db"
decimal_to_binary(32) # returns "db100000db"
"""
return "db" + bin(decimal)[2:] + "db" | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/79.py",
"license": "MIT License",
"lines": 11,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/8.py | from typing import List, Tuple
def sum_product(numbers: List[int]) -> Tuple[int, int]:
""" For a given list of integers, return a tuple consisting of a sum and a product of all the integers in a list.
Empty sum should be equal to 0 and empty product should be equal to 1.
>>> sum_product([])
(0, 1)
>>> sum_product([1, 2, 3, 4])
(10, 24)
"""
total_sum = 0
total_product = 1
for num in numbers:
total_sum += num
total_product *= num
return (total_sum, total_product) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/8.py",
"license": "MIT License",
"lines": 15,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/80.py | def is_happy(s):
"""You are given a string s.
Your task is to check if the string is happy or not.
A string is happy if its length is at least 3 and every 3 consecutive letters are distinct
For example:
is_happy(a) => False
is_happy(aa) => False
is_happy(abcd) => True
is_happy(aabb) => False
is_happy(adb) => True
is_happy(xyy) => False
"""
if len(s) < 3:
return False
for i in range(len(s) - 2):
if s[i] == s[i+1] or s[i] == s[i+2] or s[i+1] == s[i+2]:
return False
return True | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/80.py",
"license": "MIT License",
"lines": 18,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/81.py | def numerical_letter_grade(grades):
"""It is the last week of the semester and the teacher has to give the grades
to students. The teacher has been making her own algorithm for grading.
The only problem is, she has lost the code she used for grading.
She has given you a list of GPAs for some students and you have to write
a function that can output a list of letter grades using the following table:
GPA | Letter grade
4.0 A+
> 3.7 A
> 3.3 A-
> 3.0 B+
> 2.7 B
> 2.3 B-
> 2.0 C+
> 1.7 C
> 1.3 C-
> 1.0 D+
> 0.7 D
> 0.0 D-
0.0 E
Example:
grade_equation([4.0, 3, 1.7, 2, 3.5]) ==> ['A+', 'B', 'C-', 'C', 'A-']
"""
letter_grades = []
for gpa in grades:
if gpa == 4.0:
letter_grades.append('A+')
elif gpa > 3.7:
letter_grades.append('A')
elif gpa > 3.3:
letter_grades.append('A-')
elif gpa > 3.0:
letter_grades.append('B+')
elif gpa > 2.7:
letter_grades.append('B')
elif gpa > 2.3:
letter_grades.append('B-')
elif gpa > 2.0:
letter_grades.append('C+')
elif gpa > 1.7:
letter_grades.append('C')
elif gpa > 1.3:
letter_grades.append('C-')
elif gpa > 1.0:
letter_grades.append('D+')
elif gpa > 0.7:
letter_grades.append('D')
elif gpa > 0.0:
letter_grades.append('D-')
else:
letter_grades.append('E')
return letter_grades | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/81.py",
"license": "MIT License",
"lines": 52,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/82.py | def prime_length(string):
"""Write a function that takes a string and returns True if the string
length is a prime number or False otherwise
Examples
prime_length('Hello') == True
prime_length('abcdcba') == True
prime_length('kittens') == True
prime_length('orange') == False
"""
length = len(string)
if length < 2:
return False
if length == 2:
return True
if length % 2 == 0:
return False
for i in range(3, int(length ** 0.5) + 1, 2):
if length % i == 0:
return False
return True | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/82.py",
"license": "MIT License",
"lines": 20,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/83.py | def starts_one_ends(n):
"""
Given a positive integer n, return the count of the numbers of n-digit
positive integers that start or end with 1.
"""
if n == 1:
return 1
# For n-digit numbers:
# Numbers starting with 1: 1 * 10^(n-1) choices (1 followed by any n-1 digits)
# Numbers ending with 1: 9 * 10^(n-2) * 1 choices (first digit 1-9, middle n-2 digits 0-9, last digit 1)
# Numbers starting AND ending with 1: 1 * 10^(n-2) * 1 choices (overlap to subtract)
# Using inclusion-exclusion:
# |A or B| = |A| + |B| - |A and B|
starts_with_1 = 10 ** (n - 1) # 1 followed by any (n-1) digits
ends_with_1 = 9 * (10 ** (n - 2)) # first digit 1-9, middle (n-2) any, last digit 1
both = 10 ** (n - 2) # starts with 1 and ends with 1
return starts_with_1 + ends_with_1 - both | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/83.py",
"license": "MIT License",
"lines": 17,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/84.py | def solve(N):
"""Given a positive integer N, return the total sum of its digits in binary.
Example
For N = 1000, the sum of digits will be 1 the output should be "1".
For N = 150, the sum of digits will be 6 the output should be "110".
For N = 147, the sum of digits will be 12 the output should be "1100".
Variables:
@N integer
Constraints: 0 ≤ N ≤ 10000.
Output:
a string of binary number
"""
digit_sum = sum(int(d) for d in str(N))
return bin(digit_sum)[2:] | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/84.py",
"license": "MIT License",
"lines": 14,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/85.py | def add(lst):
"""Given a non-empty list of integers lst. add the even elements that are at odd indices..
Examples:
add([4, 2, 6, 7]) ==> 2
"""
total = 0
for i in range(1, len(lst), 2):
if lst[i] % 2 == 0:
total += lst[i]
return total | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/85.py",
"license": "MIT License",
"lines": 10,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/86.py | def anti_shuffle(s):
"""
Write a function that takes a string and returns an ordered version of it.
Ordered version of string, is a string where all words (separated by space)
are replaced by a new word where all the characters arranged in
ascending order based on ascii value.
Note: You should keep the order of words and blank spaces in the sentence.
For example:
anti_shuffle('Hi') returns 'Hi'
anti_shuffle('hello') returns 'ehllo'
anti_shuffle('Hello World!!!') returns 'Hello !!!Wdlor'
"""
words = s.split(' ')
sorted_words = [''.join(sorted(word)) for word in words]
return ' '.join(sorted_words) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/86.py",
"license": "MIT License",
"lines": 15,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/87.py | def get_row(lst, x):
"""
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 lst, and integer x, find integers x in the list,
and return list of tuples, [(x1, y1), (x2, y2) ...] such that
each tuple is a coordinate - (row, columns), starting with 0.
Sort coordinates initially by rows in ascending order.
Also, sort coordinates of the row by columns in descending order.
Examples:
get_row([
[1,2,3,4,5,6],
[1,2,3,4,1,6],
[1,2,3,4,5,1]
], 1) == [(0, 0), (1, 4), (1, 0), (2, 5), (2, 0)]
get_row([], 1) == []
get_row([[], [1], [1, 2, 3]], 3) == [(2, 2)]
"""
result = []
for row_idx, row in enumerate(lst):
row_matches = []
for col_idx, val in enumerate(row):
if val == x:
row_matches.append((row_idx, col_idx))
row_matches.sort(key=lambda coord: coord[1], reverse=True)
result.extend(row_matches)
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/87.py",
"license": "MIT License",
"lines": 28,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/88.py | def sort_array(array):
"""
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, last index value) is even.
Note:
* don't change the given array.
Examples:
* sort_array([]) => []
* sort_array([5]) => [5]
* sort_array([2, 4, 3, 0, 1, 5]) => [0, 1, 2, 3, 4, 5]
* sort_array([2, 4, 3, 0, 1, 5, 6]) => [6, 5, 4, 3, 2, 1, 0]
"""
if len(array) == 0:
return []
first_last_sum = array[0] + array[-1]
if first_last_sum % 2 == 1:
return sorted(array)
else:
return sorted(array, reverse=True) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/88.py",
"license": "MIT License",
"lines": 20,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/89.py | def encrypt(s):
"""Create a function encrypt that takes a string as an argument and
returns a string encrypted with the alphabet being rotated.
The alphabet should be rotated in a manner such that the letters
shift down by two multiplied to two places.
For example:
encrypt('hi') returns 'lm'
encrypt('asdfghjkl') returns 'ewhjklnop'
encrypt('gf') returns 'kj'
encrypt('et') returns 'ix'
"""
result = ""
for char in s:
if char.isalpha():
shift = 2 * 2 # two multiplied to two = 4
if char.islower():
new_char = chr((ord(char) - ord('a') + shift) % 26 + ord('a'))
else:
new_char = chr((ord(char) - ord('A') + shift) % 26 + ord('A'))
result += new_char
else:
result += char
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/89.py",
"license": "MIT License",
"lines": 23,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/9.py | from typing import List, Tuple
def rolling_max(numbers: List[int]) -> List[int]:
""" From a given list of integers, generate a list of rolling maximum element found until given moment
in the sequence.
>>> rolling_max([1, 2, 3, 2, 3, 4, 2])
[1, 2, 3, 3, 3, 4, 4]
"""
if not numbers:
return []
result = []
current_max = numbers[0]
for num in numbers:
current_max = max(current_max, num)
result.append(current_max)
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/9.py",
"license": "MIT License",
"lines": 15,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/90.py | def next_smallest(lst):
"""
You are given a list of integers.
Write a function next_smallest() that returns the 2nd smallest element of the list.
Return None if there is no such element.
next_smallest([1, 2, 3, 4, 5]) == 2
next_smallest([5, 1, 4, 3, 2]) == 2
next_smallest([]) == None
next_smallest([1, 1]) == None
"""
if len(lst) < 2:
return None
unique_sorted = sorted(set(lst))
if len(unique_sorted) < 2:
return None
return unique_sorted[1] | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/90.py",
"license": "MIT License",
"lines": 16,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/91.py | def is_bored(S):
"""
You'll be given a string of words, and your task is to count the number
of boredoms. A boredom is a sentence that starts with the word "I".
Sentences are delimited by '.', '?' or '!'.
For example:
>>> is_bored("Hello world")
0
>>> is_bored("The sky is blue. The sun is shining. I love this weather")
1
"""
import re
sentences = re.split(r'[.?!]', S)
count = 0
for sentence in sentences:
stripped = sentence.lstrip()
if stripped.startswith('I ') or stripped == 'I':
count += 1
return count | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/91.py",
"license": "MIT License",
"lines": 19,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/92.py | def any_int(x, y, z):
'''
Create a function that takes 3 numbers.
Returns true if one of the numbers is equal to the sum of the other two, and all numbers are integers.
Returns false in any other cases.
Examples
any_int(5, 2, 7) ➞ True
any_int(3, 2, 2) ➞ False
any_int(3, -2, 1) ➞ True
any_int(3.6, -2.2, 2) ➞ False
'''
if not (isinstance(x, int) and isinstance(y, int) and isinstance(z, int)):
return False
if x == y + z or y == x + z or z == x + y:
return True
return False | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/92.py",
"license": "MIT License",
"lines": 16,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/93.py | def encode(message):
"""
Write a function that takes a message, and encodes in such a
way that it swaps case of all letters, replaces all vowels in
the message with the letter that appears 2 places ahead of that
vowel in the english alphabet.
Assume only letters.
Examples:
>>> encode('test')
'TGST'
>>> encode('This is a message')
'tHKS KS C MGSSCGG'
"""
vowels = 'aeiouAEIOU'
result = []
for char in message:
if char.isalpha():
# Swap case
if char.isupper():
new_char = char.lower()
else:
new_char = char.upper()
# If it's a vowel (after case swap), replace with letter 2 places ahead
if new_char in vowels:
new_char = chr(ord(new_char) + 2)
result.append(new_char)
else:
result.append(char)
return ''.join(result) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/93.py",
"license": "MIT License",
"lines": 29,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/94.py | def skjkasdkd(lst):
"""You are given a list of integers.
You need to find the largest prime value and return the sum of its digits.
Examples:
For lst = [0,3,2,1,3,5,7,4,5,5,5,2,181,32,4,32,3,2,32,324,4,3] the output should be 10
For lst = [1,0,1,8,2,4597,2,1,3,40,1,2,1,2,4,2,5,1] the output should be 25
For lst = [1,3,1,32,5107,34,83278,109,163,23,2323,32,30,1,9,3] the output should be 13
For lst = [0,724,32,71,99,32,6,0,5,91,83,0,5,6] the output should be 11
For lst = [0,81,12,3,1,21] the output should be 3
For lst = [0,8,1,2,1,7] the output should be 7
"""
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, int(n**0.5) + 1, 2):
if n % i == 0:
return False
return True
largest_prime = -1
for num in lst:
if is_prime(num) and num > largest_prime:
largest_prime = num
if largest_prime == -1:
return 0
return sum(int(d) for d in str(largest_prime)) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/94.py",
"license": "MIT License",
"lines": 29,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/95.py | def check_dict_case(dict):
"""
Given a dictionary, return True if all keys are strings in lower
case or all keys are strings in upper case, else return False.
The function should return False is the given dictionary is empty.
Examples:
check_dict_case({"a":"apple", "b":"banana"}) should return True.
check_dict_case({"a":"apple", "A":"banana", "B":"banana"}) should return False.
check_dict_case({"a":"apple", 8:"banana", "a":"apple"}) should return False.
check_dict_case({"Name":"John", "Age":"36", "City":"Houston"}) should return False.
check_dict_case({"STATE":"NC", "ZIP":"12345" }) should return True.
"""
if len(dict) == 0:
return False
all_lower = True
all_upper = True
for key in dict.keys():
if not isinstance(key, str):
return False
if not key.islower():
all_lower = False
if not key.isupper():
all_upper = False
return all_lower or all_upper | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/95.py",
"license": "MIT License",
"lines": 24,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/96.py | def count_up_to(n):
"""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.
for example:
count_up_to(5) => [2,3]
count_up_to(11) => [2,3,5,7]
count_up_to(0) => []
count_up_to(20) => [2,3,5,7,11,13,17,19]
count_up_to(1) => []
count_up_to(18) => [2,3,5,7,11,13,17]
"""
def is_prime(num):
if num < 2:
return False
if num == 2:
return True
if num % 2 == 0:
return False
for i in range(3, int(num ** 0.5) + 1, 2):
if num % i == 0:
return False
return True
primes = []
for i in range(2, n):
if is_prime(i):
primes.append(i)
return primes | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/96.py",
"license": "MIT License",
"lines": 27,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/97.py | def multiply(a, b):
"""Complete the function that takes two integers and returns
the product of their unit digits.
Assume the input is always valid.
Examples:
multiply(148, 412) should return 16.
multiply(19, 28) should return 72.
multiply(2020, 1851) should return 0.
multiply(14,-15) should return 20.
"""
unit_a = abs(a) % 10
unit_b = abs(b) % 10
return unit_a * unit_b | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/97.py",
"license": "MIT License",
"lines": 13,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/98.py | def count_upper(s):
"""
Given a string s, count the number of uppercase vowels in even indices.
For example:
count_upper('aBCdEf') returns 1
count_upper('abcdefg') returns 0
count_upper('dBBE') returns 0
"""
uppercase_vowels = 'AEIOU'
count = 0
for i in range(0, len(s), 2):
if s[i] in uppercase_vowels:
count += 1
return count | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/98.py",
"license": "MIT License",
"lines": 14,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/99.py | def closest_integer(value):
'''
Create a function that takes a value (string) representing a number
and returns the closest integer to it. If the number is equidistant
from two integers, round it away from zero.
Examples
>>> closest_integer("10")
10
>>> closest_integer("15.3")
15
Note:
Rounding away from zero means that if the given number is equidistant
from two integers, the one you should return is the one that is the
farthest from zero. For example closest_integer("14.5") should
return 15 and closest_integer("-14.5") should return -15.
'''
num = float(value)
if num >= 0:
if num - int(num) == 0.5:
return int(num) + 1
else:
return round(num)
else:
if int(num) - num == 0.5:
return int(num) - 1
else:
return round(num) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/99.py",
"license": "MIT License",
"lines": 27,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/0.py | # HumanEval/0
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
from typing import List
def has_close_elements(numbers: List[float], threshold: float) -> bool:
""" Check if in given list of numbers, are any two numbers closer to each other than
given threshold.
>>> has_close_elements([1.0, 2.0, 3.0], 0.5)
False
>>> has_close_elements([1.0, 2.8, 3.0, 4.0, 5.0, 2.0], 0.3)
True
"""
for i in range(len(numbers)):
for j in range(i + 1, len(numbers)):
if abs(numbers[i] - numbers[j]) < threshold:
return True
return False | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/0.py",
"license": "MIT License",
"lines": 18,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/1.py | # HumanEval/1
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
from typing import List
def separate_paren_groups(paren_string: str) -> List[str]:
""" 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 nested within each other
Ignore any spaces in the input string.
>>> separate_paren_groups('( ) (( )) (( )( ))')
['()', '(())', '(()())']
"""
result = []
current_group = []
depth = 0
for char in paren_string:
if char == ' ':
continue
if char == '(':
depth += 1
current_group.append(char)
elif char == ')':
depth -= 1
current_group.append(char)
if depth == 0:
result.append(''.join(current_group))
current_group = []
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/1.py",
"license": "MIT License",
"lines": 29,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/10.py | # HumanEval/10
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def is_palindrome(string: str) -> bool:
""" Test if given string is a palindrome """
return string == string[::-1]
def make_palindrome(string: str) -> str:
""" Find the shortest palindrome that begins with a supplied string.
Algorithm idea is simple:
- Find the longest postfix of supplied string that is a palindrome.
- Append to the end of the string reverse of a string prefix that comes before the palindromic suffix.
>>> make_palindrome('')
''
>>> make_palindrome('cat')
'catac'
>>> make_palindrome('cata')
'catac'
"""
if not string:
return ''
for i in range(len(string)):
if is_palindrome(string[i:]):
return string + string[:i][::-1]
return string | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/10.py",
"license": "MIT License",
"lines": 25,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/100.py | # HumanEval/100
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def make_a_pile(n):
"""
Given a positive integer n, you have to make a pile of n levels of stones.
The first level has n stones.
The number of stones in the next level is:
- the next odd number if n is odd.
- the next even number if n is even.
Return the number of stones in each level in a list, where element at index
i represents the number of stones in the level (i+1).
Examples:
>>> make_a_pile(3)
[3, 5, 7]
"""
result = [n]
for _ in range(n - 1):
result.append(result[-1] + 2)
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/100.py",
"license": "MIT License",
"lines": 21,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/101.py | # HumanEval/101
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def words_string(s):
"""
You will be given a string of words separated by commas or spaces. Your task is
to split the string into words and return an array of the words.
For example:
words_string("Hi, my name is John") == ["Hi", "my", "name", "is", "John"]
words_string("One, two, three, four, five, six") == ["One", "two", "three", "four", "five", "six"]
"""
if not s:
return []
return s.replace(",", " ").split() | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/101.py",
"license": "MIT License",
"lines": 15,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/102.py | # HumanEval/102
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def choose_num(x, y):
"""This function takes two positive numbers x and y and returns the
biggest even integer number that is in the range [x, y] inclusive. If
there's no such number, then the function should return -1.
For example:
choose_num(12, 15) = 14
choose_num(13, 12) = -1
"""
if x > y:
return -1
if y % 2 == 0:
return y
if y - 1 >= x:
return y - 1
return -1 | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/102.py",
"license": "MIT License",
"lines": 19,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/103.py | # HumanEval/103
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def rounded_avg(n, m):
"""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"
"""
if n > m:
return -1
count = m - n + 1
total = count * (n + m) // 2
avg = round(total / count)
return bin(avg) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/103.py",
"license": "MIT License",
"lines": 21,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/104.py | # HumanEval/104
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def unique_digits(x):
"""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])
[]
"""
even_digits = set("02468")
result = []
for num in x:
if not any(d in even_digits for d in str(num)):
result.append(num)
return sorted(result) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/104.py",
"license": "MIT License",
"lines": 20,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/105.py | # HumanEval/105
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def by_length(arr):
"""
Given an array of integers, sort the integers that are between 1 and 9 inclusive,
reverse the resulting array, and then replace each digit by its corresponding name from
"One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine".
For example:
arr = [2, 1, 1, 4, 5, 8, 2, 3]
-> sort arr -> [1, 1, 2, 2, 3, 4, 5, 8]
-> reverse arr -> [8, 5, 4, 3, 2, 2, 1, 1]
return ["Eight", "Five", "Four", "Three", "Two", "Two", "One", "One"]
If the array is empty, return an empty array:
arr = []
return []
If the array has any strange number ignore it:
arr = [1, -1 , 55]
-> sort arr -> [-1, 1, 55]
-> reverse arr -> [55, 1, -1]
return = ['One']
"""
names = ["One", "Two", "Three", "Four", "Five", "Six", "Seven", "Eight", "Nine"]
filtered = [x for x in arr if 1 <= x <= 9]
filtered.sort()
filtered.reverse()
return [names[x - 1] for x in filtered] | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/105.py",
"license": "MIT License",
"lines": 28,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/106.py | # HumanEval/106
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def f(n):
""" 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]
"""
result = []
for i in range(1, n + 1):
if i % 2 == 0:
# Even i: compute factorial
factorial = 1
for j in range(1, i + 1):
factorial *= j
result.append(factorial)
else:
# Odd i: compute sum from 1 to i
result.append(i * (i + 1) // 2)
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/106.py",
"license": "MIT License",
"lines": 25,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/107.py | # HumanEval/107
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def even_odd_palindrome(n):
"""
Given a positive integer n, return a tuple that has the number of even and odd
integer palindromes that fall within the range(1, n), inclusive.
Example 1:
Input: 3
Output: (1, 2)
Explanation:
Integer palindrome are 1, 2, 3. one of them is even, and two of them are odd.
Example 2:
Input: 12
Output: (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 tuple has the number of even and odd integer palindromes respectively.
"""
even_count = 0
odd_count = 0
for i in range(1, n + 1):
s = str(i)
if s == s[::-1]:
if i % 2 == 0:
even_count += 1
else:
odd_count += 1
return (even_count, odd_count) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/107.py",
"license": "MIT License",
"lines": 32,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/108.py | # HumanEval/108
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def count_nums(arr):
"""
Write a function count_nums which takes an array of integers and returns
the number of elements which has a sum of digits > 0.
If a number is negative, then its first signed digit will be negative:
e.g. -123 has signed digits -1, 2, and 3.
>>> count_nums([]) == 0
>>> count_nums([-1, 11, -11]) == 1
>>> count_nums([1, 1, 2]) == 3
"""
count = 0
for num in arr:
if num == 0:
continue
is_negative = num < 0
num = abs(num)
digits = [int(d) for d in str(num)]
if is_negative:
digits[0] = -digits[0]
if sum(digits) > 0:
count += 1
return count | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/108.py",
"license": "MIT License",
"lines": 26,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/109.py | # HumanEval/109
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def move_one_ball(arr):
"""We have an array 'arr' of N integers arr[1], arr[2], ..., arr[N].The
numbers in the array will be randomly ordered. Your task is to determine if
it is possible to get an array sorted in non-decreasing order by performing
the following operation on the given array:
You are allowed to perform right shift operation any number of times.
One right shift operation means shifting all elements of the array by one
position in the right direction. The last element of the array will be moved to
the starting position in the array i.e. 0th index.
If it is possible to obtain the sorted array by performing the above operation
then return True else return False.
If the given array 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 array.
move_one_ball([3, 5, 4, 1, 2])==>False
Explanation:It is not possible to get non-decreasing order for the given
array by performing any number of right shift operations.
"""
if len(arr) <= 1:
return True
# Count the number of break points where arr[i] > arr[i+1]
break_count = 0
n = len(arr)
for i in range(n - 1):
if arr[i] > arr[i + 1]:
break_count += 1
# If already sorted, return True
if break_count == 0:
return True
# If exactly one break point and the wrap-around is valid
# (last element <= first element), it can be rotated to sorted order
if break_count == 1 and arr[-1] <= arr[0]:
return True
return False | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/109.py",
"license": "MIT License",
"lines": 41,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/11.py | # HumanEval/11
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
from typing import List
def string_xor(a: str, b: str) -> str:
""" Input are two strings a and b consisting only of 1s and 0s.
Perform binary XOR on these inputs and return result also as a string.
>>> string_xor('010', '110')
'100'
"""
result = []
for char_a, char_b in zip(a, b):
if char_a == char_b:
result.append('0')
else:
result.append('1')
return ''.join(result) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/11.py",
"license": "MIT License",
"lines": 18,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/110.py | # HumanEval/110
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def exchange(lst1, lst2):
"""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.
"""
odds_in_lst1 = sum(1 for x in lst1 if x % 2 != 0)
evens_in_lst2 = sum(1 for x in lst2 if x % 2 == 0)
if evens_in_lst2 >= odds_in_lst1:
return "YES"
else:
return "NO" | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/110.py",
"license": "MIT License",
"lines": 23,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/111.py | # HumanEval/111
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def histogram(test):
"""Given a string representing a space separated lowercase letters, return a dictionary
of the letter with the most repetition and containing the corresponding count.
If several letters have the same occurrence, return all of them.
Example:
histogram('a b c') == {'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('') == {}
"""
if not test or not test.strip():
return {}
letters = test.split()
counts = {}
for letter in letters:
if letter:
counts[letter] = counts.get(letter, 0) + 1
if not counts:
return {}
max_count = max(counts.values())
return {letter: count for letter, count in counts.items() if count == max_count} | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/111.py",
"license": "MIT License",
"lines": 26,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/112.py | # HumanEval/112
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def reverse_delete(s,c):
"""Task
We are given two strings s and c, you have to deleted all the characters in s that are equal to any character in c
then check if the result string is palindrome.
A string is called palindrome if it reads the same backward as forward.
You should return a tuple containing the result string and True/False for the check.
Example
For s = "abcde", c = "ae", the result should be ('bcd',False)
For s = "abcdef", c = "b" the result should be ('acdef',False)
For s = "abcdedcba", c = "ab", the result should be ('cdedc',True)
"""
chars_to_delete = set(c)
result = ''.join(char for char in s if char not in chars_to_delete)
is_palindrome = result == result[::-1]
return (result, is_palindrome) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/112.py",
"license": "MIT License",
"lines": 19,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/113.py | # HumanEval/113
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def odd_count(lst):
"""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."]
"""
result = []
for s in lst:
odd_digit_count = sum(1 for d in s if int(d) % 2 == 1)
count_str = str(odd_digit_count)
template = "the number of odd elements in the string i of the input."
formatted = template.replace('i', count_str)
result.append(formatted)
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/113.py",
"license": "MIT License",
"lines": 23,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/114.py | # HumanEval/114
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def minSubArraySum(nums):
"""
Given an array of integers nums, find the minimum sum of any non-empty sub-array
of nums.
Example
minSubArraySum([2, 3, 4, 1, 2, 4]) == 1
minSubArraySum([-1, -2, -3]) == -6
"""
if not nums:
return 0
min_ending_here = nums[0]
min_so_far = nums[0]
for i in range(1, len(nums)):
min_ending_here = min(nums[i], min_ending_here + nums[i])
min_so_far = min(min_so_far, min_ending_here)
return min_so_far | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/114.py",
"license": "MIT License",
"lines": 20,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/115.py | # HumanEval/115
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def max_fill(grid, capacity):
import math
"""
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:
Input:
grid : [[0,0,1,0], [0,1,0,0], [1,1,1,1]]
bucket_capacity : 1
Output: 6
Example 2:
Input:
grid : [[0,0,1,1], [0,0,0,0], [1,1,1,1], [0,1,1,1]]
bucket_capacity : 2
Output: 5
Example 3:
Input:
grid : [[0,0,0], [0,0,0]]
bucket_capacity : 5
Output: 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
"""
return sum(math.ceil(sum(row) / capacity) for row in grid if sum(row) > 0) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/115.py",
"license": "MIT License",
"lines": 36,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/116.py | # HumanEval/116
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def sort_array(arr):
"""
In this Kata, you have to sort an array of non-negative integers according to
number of ones in their binary representation in ascending order.
For similar number of ones, sort based on decimal value.
It must be implemented like this:
>>> sort_array([1, 5, 2, 3, 4]) == [1, 2, 3, 4, 5]
>>> sort_array([-2, -3, -4, -5, -6]) == [-6, -5, -4, -3, -2]
>>> sort_array([1, 0, 2, 3, 4]) [0, 1, 2, 3, 4]
"""
return sorted(arr, key=lambda x: (bin(x).count('1'), x)) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/116.py",
"license": "MIT License",
"lines": 15,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/117.py | # HumanEval/117
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def select_words(s, n):
"""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"]
"""
if not s:
return []
vowels = "aeiouAEIOU"
result = []
for word in s.split():
consonant_count = sum(1 for char in word if char.isalpha() and char not in vowels)
if consonant_count == n:
result.append(word)
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/117.py",
"license": "MIT License",
"lines": 26,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/118.py | # HumanEval/118
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def get_closest_vowel(word):
"""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") ==> ""
"""
if len(word) < 3:
return ""
vowels = set("aeiouAEIOU")
for i in range(len(word) - 2, 0, -1):
if word[i] in vowels:
if word[i - 1] not in vowels and word[i + 1] not in vowels:
return word[i]
return "" | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/118.py",
"license": "MIT License",
"lines": 24,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/119.py | # HumanEval/119
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def match_parens(lst):
'''
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'
'''
def is_balanced(s):
balance = 0
for char in s:
if char == '(':
balance += 1
else:
balance -= 1
if balance < 0:
return False
return balance == 0
# Try both concatenation orders
if is_balanced(lst[0] + lst[1]) or is_balanced(lst[1] + lst[0]):
return 'Yes'
return 'No' | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/119.py",
"license": "MIT License",
"lines": 32,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/12.py | # HumanEval/12
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
from typing import List, Optional
def longest(strings: List[str]) -> Optional[str]:
""" Out of list of strings, return the longest one. Return the first one in case of multiple
strings of the same length. Return None in case the input list is empty.
>>> longest([])
>>> longest(['a', 'b', 'c'])
'a'
>>> longest(['a', 'bb', 'ccc'])
'ccc'
"""
if not strings:
return None
longest_str = strings[0]
for s in strings[1:]:
if len(s) > len(longest_str):
longest_str = s
return longest_str | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/12.py",
"license": "MIT License",
"lines": 21,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/120.py | # HumanEval/120
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def maximum(arr, k):
"""
Given an array arr of integers and a positive integer k, return a sorted list
of length k with the maximum k numbers in arr.
Example 1:
Input: arr = [-3, -4, 5], k = 3
Output: [-4, -3, 5]
Example 2:
Input: arr = [4, -4, 4], k = 2
Output: [4, 4]
Example 3:
Input: arr = [-3, 2, 1, 2, -1, -2, 1], k = 1
Output: [2]
Note:
1. The length of the array will be in the range of [1, 1000].
2. The elements in the array will be in the range of [-1000, 1000].
3. 0 <= k <= len(arr)
"""
if k == 0:
return []
return sorted(arr)[-k:] | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/120.py",
"license": "MIT License",
"lines": 25,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/121.py | # HumanEval/121
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def solution(lst):
"""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
"""
return sum(x for x in lst[::2] if x % 2 == 1) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/121.py",
"license": "MIT License",
"lines": 12,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/122.py | # HumanEval/122
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def add_elements(arr, k):
"""
Given a non-empty array of integers arr and an integer k, return
the sum of the elements with at most two digits from the first k elements of arr.
Example:
Input: arr = [111,21,3,4000,5,6,7,8,9], k = 4
Output: 24 # sum of 21 + 3
Constraints:
1. 1 <= len(arr) <= 100
2. 1 <= k <= len(arr)
"""
total = 0
for element in arr[:k]:
if -99 <= element <= 99:
total += element
return total | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/122.py",
"license": "MIT License",
"lines": 20,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/123.py | # HumanEval/123
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def get_odd_collatz(n):
"""
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.
"""
odd_numbers = set()
while n >= 1:
if n % 2 == 1:
odd_numbers.add(n)
if n == 1:
break
if n % 2 == 0:
n = n // 2
else:
n = 3 * n + 1
return sorted(odd_numbers) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/123.py",
"license": "MIT License",
"lines": 29,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/124.py | # HumanEval/124
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def valid_date(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
for example:
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
"""
if not date or not isinstance(date, str):
return False
parts = date.split('-')
if len(parts) != 3:
return False
mm, dd, yyyy = parts
if len(mm) != 2 or len(dd) != 2 or len(yyyy) != 4:
return False
try:
month = int(mm)
day = int(dd)
year = int(yyyy)
except ValueError:
return False
if month < 1 or month > 12:
return False
if month in [1, 3, 5, 7, 8, 10, 12]:
max_days = 31
elif month in [4, 6, 9, 11]:
max_days = 30
else:
max_days = 29
if day < 1 or day > max_days:
return False
return True | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/124.py",
"license": "MIT License",
"lines": 44,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_complex |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/125.py | # HumanEval/125
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def split_words(txt):
'''
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
'''
if ' ' in txt:
return txt.split()
elif ',' in txt:
return txt.split(',')
else:
count = 0
for char in txt:
if char.islower() and (ord(char) - ord('a')) % 2 == 1:
count += 1
return count | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/125.py",
"license": "MIT License",
"lines": 24,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/126.py | # HumanEval/126
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def is_sorted(lst):
'''
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
'''
# Check if sorted in ascending order
for i in range(len(lst) - 1):
if lst[i] > lst[i + 1]:
return False
# Check that no number appears more than twice
count = {}
for num in lst:
count[num] = count.get(num, 0) + 1
if count[num] > 2:
return False
return True | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/126.py",
"license": "MIT License",
"lines": 30,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/127.py | # HumanEval/127
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def intersection(interval1, interval2):
"""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"
"""
start = max(interval1[0], interval2[0])
end = min(interval1[1], interval2[1])
if start > end:
return "NO"
length = end - start
if length < 2:
return "NO"
for i in range(2, int(length ** 0.5) + 1):
if length % i == 0:
return "NO"
return "YES" | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/127.py",
"license": "MIT License",
"lines": 33,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/128.py | # HumanEval/128
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def prod_signs(arr):
"""
You are given an array arr of integers and you need to return
sum of magnitudes of integers multiplied by product of all signs
of each number in the array, represented by 1, -1 or 0.
Note: return None for empty arr.
Example:
>>> prod_signs([1, 2, 2, -4]) == -9
>>> prod_signs([0, 1]) == 0
>>> prod_signs([]) == None
"""
if not arr:
return None
sign_product = 1
magnitude_sum = 0
for num in arr:
if num == 0:
sign_product = 0
elif num < 0:
sign_product *= -1
magnitude_sum += abs(num)
return sign_product * magnitude_sum | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/128.py",
"license": "MIT License",
"lines": 26,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/129.py | # HumanEval/129
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def minPath(grid, k):
"""
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:
Input: grid = [ [1,2,3], [4,5,6], [7,8,9]], k = 3
Output: [1, 2, 1]
Input: grid = [ [5,9,3], [4,1,6], [7,8,2]], k = 1
Output: [1]
"""
n = len(grid)
# Find the position of cell with value 1
row_1, col_1 = 0, 0
for i in range(n):
for j in range(n):
if grid[i][j] == 1:
row_1, col_1 = i, j
break
# Find the smallest neighbor of cell with value 1
min_neighbor = n * n + 1
directions = [(-1, 0), (1, 0), (0, -1), (0, 1)]
for dr, dc in directions:
nr, nc = row_1 + dr, col_1 + dc
if 0 <= nr < n and 0 <= nc < n:
min_neighbor = min(min_neighbor, grid[nr][nc])
# Build the result: alternating pattern of 1 and min_neighbor
result = []
for i in range(k):
if i % 2 == 0:
result.append(1)
else:
result.append(min_neighbor)
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/129.py",
"license": "MIT License",
"lines": 53,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/13.py | # HumanEval/13
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def greatest_common_divisor(a: int, b: int) -> int:
""" Return a greatest common divisor of two integers a and b
>>> greatest_common_divisor(3, 5)
1
>>> greatest_common_divisor(25, 15)
5
"""
a = abs(a)
b = abs(b)
while b:
a, b = b, a % b
return a | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/13.py",
"license": "MIT License",
"lines": 16,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/130.py | # HumanEval/130
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def tri(n):
"""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]
"""
if n == 0:
return [1]
result = [1, 3]
for i in range(2, n + 1):
if i % 2 == 0:
result.append(1 + i // 2)
else:
next_even = 1 + (i + 1) // 2
result.append(result[i - 1] + result[i - 2] + next_even)
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/130.py",
"license": "MIT License",
"lines": 31,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/131.py | # HumanEval/131
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def digits(n):
"""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
"""
product = 1
has_odd = False
while n > 0:
digit = n % 10
if digit % 2 == 1:
product *= digit
has_odd = True
n //= 10
return product if has_odd else 0 | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/131.py",
"license": "MIT License",
"lines": 21,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/132.py | # HumanEval/132
# Loki Mode Multi-Agent Solution
# Attempts: 2
# Passed: True
def is_nested(string):
'''
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
'''
depth = 0
max_depth = 0
for char in string:
if char == '[':
depth += 1
max_depth = max(max_depth, depth)
elif char == ']':
if depth > 0:
depth -= 1
if depth == 0 and max_depth >= 2:
return True
if depth == 0:
max_depth = 0
return False | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/132.py",
"license": "MIT License",
"lines": 30,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/133.py | # HumanEval/133
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
import math
def sum_squares(lst):
"""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:
For lst = [1,2,3] the output should be 14
For lst = [1,4,9] the output should be 98
For lst = [1,3,5,7] the output should be 84
For lst = [1.4,4.2,0] the output should be 29
For lst = [-2.4,1,1] the output should be 6
"""
return sum(math.ceil(x)**2 for x in lst) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/133.py",
"license": "MIT License",
"lines": 17,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/134.py | # HumanEval/134
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def check_if_last_char_is_a_letter(txt):
'''
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
'''
if not txt or not txt[-1].isalpha():
return False
if len(txt) == 1:
return True
return txt[-2] == ' ' | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/134.py",
"license": "MIT License",
"lines": 21,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/135.py | # HumanEval/135
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def can_arrange(arr):
"""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 array will not contain
duplicate values.
Examples:
can_arrange([1,2,4,3,5]) = 3
can_arrange([1,2,3]) = -1
"""
result = -1
for i in range(1, len(arr)):
if arr[i] < arr[i - 1]:
result = i
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/135.py",
"license": "MIT License",
"lines": 18,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/136.py | # HumanEval/136
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def largest_smallest_integers(lst):
'''
Create a function that returns a tuple (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 None.
Examples:
largest_smallest_integers([2, 4, 1, 3, 5, 7]) == (None, 1)
largest_smallest_integers([]) == (None, None)
largest_smallest_integers([0]) == (None, None)
'''
negatives = [x for x in lst if x < 0]
positives = [x for x in lst if x > 0]
largest_negative = max(negatives) if negatives else None
smallest_positive = min(positives) if positives else None
return (largest_negative, smallest_positive) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/136.py",
"license": "MIT License",
"lines": 20,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/137.py | # HumanEval/137
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def compare_one(a, b):
"""
Create a function that takes integers, floats, or strings representing
real numbers, and returns the larger variable in its given variable type.
Return None 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) ➞ None
"""
def to_float(x):
if isinstance(x, str):
return float(x.replace(",", "."))
return float(x)
val_a = to_float(a)
val_b = to_float(b)
if val_a == val_b:
return None
elif val_a > val_b:
return a
else:
return b | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/137.py",
"license": "MIT License",
"lines": 27,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/138.py | # HumanEval/138
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def is_equal_to_sum_even(n):
"""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
"""
return n >= 8 and n % 2 == 0 | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/138.py",
"license": "MIT License",
"lines": 12,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/139.py | # HumanEval/139
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def special_factorial(n):
"""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.
"""
result = 1
current_factorial = 1
for k in range(1, n + 1):
current_factorial *= k
result *= current_factorial
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/139.py",
"license": "MIT License",
"lines": 20,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/14.py | # HumanEval/14
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
from typing import List
def all_prefixes(string: str) -> List[str]:
""" Return list of all prefixes from shortest to longest of the input string
>>> all_prefixes('abc')
['a', 'ab', 'abc']
"""
return [string[:i] for i in range(1, len(string) + 1)] | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/14.py",
"license": "MIT License",
"lines": 11,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/140.py | # HumanEval/140
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
import re
def fix_spaces(text):
"""
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"
"""
def replace_spaces(match):
spaces = match.group(0)
if len(spaces) > 2:
return '-'
else:
return '_' * len(spaces)
return re.sub(r' +', replace_spaces, text) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/140.py",
"license": "MIT License",
"lines": 22,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/141.py | # HumanEval/141
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def file_name_check(file_name):
"""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' (the name should start with a latin alphapet letter)
"""
# Check for exactly one dot
if file_name.count('.') != 1:
return 'No'
# Split by dot
parts = file_name.split('.')
prefix = parts[0]
suffix = parts[1]
# Check prefix is non-empty and starts with a letter
if len(prefix) == 0 or not prefix[0].isalpha():
return 'No'
# Check suffix is valid
if suffix not in ['txt', 'exe', 'dll']:
return 'No'
# Count digits in entire filename
digit_count = sum(1 for c in file_name if c.isdigit())
if digit_count > 3:
return 'No'
return 'Yes' | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/141.py",
"license": "MIT License",
"lines": 36,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_complex |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/142.py | # HumanEval/142
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def sum_squares(lst):
""""
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:
For lst = [1,2,3] the output should be 6
For lst = [] the output should be 0
For lst = [-1,-5,2,-1,-5] the output should be -126
"""
result = 0
for i in range(len(lst)):
if i % 3 == 0:
result += lst[i] ** 2
elif i % 4 == 0:
result += lst[i] ** 3
else:
result += lst[i]
return result | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/142.py",
"license": "MIT License",
"lines": 23,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/143.py | # HumanEval/143
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def words_in_sentence(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:
Input: sentence = "This is a test"
Output: "is"
Example 2:
Input: sentence = "lets go for swimming"
Output: "go for"
Constraints:
* 1 <= len(sentence) <= 100
* sentence contains only letters
"""
def is_prime(n):
if n < 2:
return False
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, int(n ** 0.5) + 1, 2):
if n % i == 0:
return False
return True
words = sentence.split()
prime_words = [word for word in words if is_prime(len(word))]
return " ".join(prime_words) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/143.py",
"license": "MIT License",
"lines": 35,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/144.py | # HumanEval/144
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def simplify(x, n):
"""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_num, x_den = map(int, x.split('/'))
n_num, n_den = map(int, n.split('/'))
numerator = x_num * n_num
denominator = x_den * n_den
return numerator % denominator == 0 | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/144.py",
"license": "MIT License",
"lines": 19,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/145.py | # HumanEval/145
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def order_by_points(nums):
"""
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([]) == []
"""
def digit_sum(n):
s = str(n)
if s[0] == '-':
return -int(s[1]) + sum(int(d) for d in s[2:])
else:
return sum(int(d) for d in s)
return sorted(nums, key=digit_sum) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/145.py",
"license": "MIT License",
"lines": 21,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/146.py | # HumanEval/146
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def specialFilter(nums):
"""Write a function that takes an array of numbers as input and returns
the number of elements in the array 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
"""
odd_digits = {'1', '3', '5', '7', '9'}
count = 0
for num in nums:
if num > 10:
s = str(num)
if s[0] in odd_digits and s[-1] in odd_digits:
count += 1
return count | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/146.py",
"license": "MIT License",
"lines": 20,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/147.py | # HumanEval/147
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def get_max_triples(n):
"""
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.
Example :
Input: n = 5
Output: 1
Explanation:
a = [1, 3, 7, 13, 21]
The only valid triple is (1, 7, 13).
"""
if n < 3:
return 0
a = [i * i - i + 1 for i in range(1, n + 1)]
count = 0
for i in range(n):
for j in range(i + 1, n):
for k in range(j + 1, n):
if (a[i] + a[j] + a[k]) % 3 == 0:
count += 1
return count | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/147.py",
"license": "MIT License",
"lines": 27,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/148.py | # HumanEval/148
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def bf(planet1, planet2):
'''
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 tuple 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 tuple 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")
'''
planets = ("Mercury", "Venus", "Earth", "Mars", "Jupiter", "Saturn", "Uranus", "Neptune")
if planet1 not in planets or planet2 not in planets:
return ()
idx1 = planets.index(planet1)
idx2 = planets.index(planet2)
if idx1 > idx2:
idx1, idx2 = idx2, idx1
return planets[idx1 + 1:idx2] | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/148.py",
"license": "MIT License",
"lines": 28,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/149.py | # HumanEval/149
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def sorted_list_sum(lst):
"""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 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:
assert list_sort(["aa", "a", "aaa"]) => ["aa"]
assert list_sort(["ab", "a", "aaa", "cd"]) => ["ab", "cd"]
"""
filtered = [s for s in lst if len(s) % 2 == 0]
return sorted(filtered, key=lambda x: (len(x), x)) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/149.py",
"license": "MIT License",
"lines": 21,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/15.py | # HumanEval/15
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def string_sequence(n: int) -> str:
""" Return a string containing space-delimited numbers starting from 0 upto n inclusive.
>>> string_sequence(0)
'0'
>>> string_sequence(5)
'0 1 2 3 4 5'
"""
return ' '.join(str(i) for i in range(n + 1)) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/15.py",
"license": "MIT License",
"lines": 12,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/150.py | # HumanEval/150
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def x_or_y(n, x, 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:
for x_or_y(7, 34, 12) == 34
for x_or_y(15, 8, 5) == 5
"""
if n <= 1:
return y
if n == 2:
return x
if n % 2 == 0:
return y
i = 3
while i * i <= n:
if n % i == 0:
return y
i += 2
return x | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/150.py",
"license": "MIT License",
"lines": 23,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/151.py | # HumanEval/151
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def double_the_difference(lst):
'''
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]) == 1 + 9 + 0 + 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.
'''
total = 0
for n in lst:
if isinstance(n, int) and not isinstance(n, bool) and n > 0 and n % 2 != 0:
total += n * n
return total | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/151.py",
"license": "MIT License",
"lines": 19,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/152.py | # HumanEval/152
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def compare(game,guess):
"""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 arrays of scores and guesses of equal length, where each index shows a match.
Return an array 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]
"""
return [abs(g - s) for g, s in zip(game, guess)] | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/152.py",
"license": "MIT License",
"lines": 17,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/153.py | # HumanEval/153
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def Strongest_Extension(class_name, extensions):
"""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:
for Strongest_Extension('my_class', ['AA', 'Be', 'CC']) == 'my_class.AA'
"""
strongest_ext = extensions[0]
max_strength = sum(1 for c in strongest_ext if c.isupper()) - sum(1 for c in strongest_ext if c.islower())
for ext in extensions[1:]:
strength = sum(1 for c in ext if c.isupper()) - sum(1 for c in ext if c.islower())
if strength > max_strength:
max_strength = strength
strongest_ext = ext
return f"{class_name}.{strongest_ext}" | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/153.py",
"license": "MIT License",
"lines": 29,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | documentation |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/154.py | # HumanEval/154
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def cycpattern_check(a , b):
"""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
"""
if len(b) == 0:
return True
if len(b) > len(a):
return False
for i in range(len(b)):
rotation = b[i:] + b[:i]
if rotation in a:
return True
return False | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/154.py",
"license": "MIT License",
"lines": 22,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
davila7/claude-code-templates:cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/155.py | # HumanEval/155
# Loki Mode Multi-Agent Solution
# Attempts: 1
# Passed: True
def even_odd_count(num):
"""Given an integer. return a tuple that has the number of even and odd digits respectively.
Example:
even_odd_count(-12) ==> (1, 1)
even_odd_count(123) ==> (1, 2)
"""
even_count = 0
odd_count = 0
for digit in str(abs(num)):
if int(digit) % 2 == 0:
even_count += 1
else:
odd_count += 1
return (even_count, odd_count) | {
"repo_id": "davila7/claude-code-templates",
"file_path": "cli-tool/components/skills/ai-research/loki-mode/benchmarks/results/humaneval-loki-solutions/155.py",
"license": "MIT License",
"lines": 18,
"canary_id": -1,
"canary_value": "",
"pii_type": "",
"provider": "",
"regex_pattern": "",
"repetition": -1,
"template": ""
} | function_simple |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.