Fix: Ensure all skills are tracked as files, not submodules
This commit is contained in:
@@ -0,0 +1,55 @@
|
||||
# HumanEval/68
|
||||
# Loki Mode Multi-Agent Solution
|
||||
# Attempts: 1
|
||||
# Passed: True
|
||||
|
||||
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 []
|
||||
|
||||
min_even = None
|
||||
min_index = None
|
||||
|
||||
for i, val in enumerate(arr):
|
||||
if val % 2 == 0:
|
||||
if min_even is None or val < min_even:
|
||||
min_even = val
|
||||
min_index = i
|
||||
|
||||
if min_even is None:
|
||||
return []
|
||||
|
||||
return [min_even, min_index]
|
||||
Reference in New Issue
Block a user