wegho-agentes 7.0.4 → 7.0.6

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/60.py

@@ -1,14 +0,0 @@
-def sum_to_n(n: int):
-    """sum_to_n is a function that sums numbers from 1 to n.
-    >>> sum_to_n(30)
-    465
-    >>> sum_to_n(100)
-    5050
-    >>> sum_to_n(5)
-    15
-    >>> sum_to_n(10)
-    55
-    >>> sum_to_n(1)
-    1
-    """
-    return n * (n + 1) // 2

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/61.py

@@ -1,22 +0,0 @@
-def correct_bracketing(brackets: str):
-    """ brackets is a string of "(" and ")".
-    return True if every opening bracket has a corresponding closing bracket.
-
-    >>> correct_bracketing("(")
-    False
-    >>> correct_bracketing("()")
-    True
-    >>> correct_bracketing("(()())")
-    True
-    >>> correct_bracketing(")(()")
-    False
-    """
-    count = 0
-    for bracket in brackets:
-        if bracket == "(":
-            count += 1
-        elif bracket == ")":
-            count -= 1
-        if count < 0:
-            return False
-    return count == 0

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/62.py

@@ -1,10 +0,0 @@
-def derivative(xs: list):
-    """ xs represent coefficients of a polynomial.
-    xs[0] + xs[1] * x + xs[2] * x^2 + ....
-     Return derivative of this polynomial in the same form.
-    >>> derivative([3, 1, 2, 4, 5])
-    [1, 4, 12, 20]
-    >>> derivative([1, 2, 3])
-    [2, 6]
-    """
-    return [i * xs[i] for i in range(1, len(xs))]

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/63.py

@@ -1,25 +0,0 @@
-def fibfib(n: int):
-    """The FibFib number sequence is a sequence similar to the Fibbonacci sequnece that's defined as follows:
-    fibfib(0) == 0
-    fibfib(1) == 0
-    fibfib(2) == 1
-    fibfib(n) == fibfib(n-1) + fibfib(n-2) + fibfib(n-3).
-    Please write a function to efficiently compute the n-th element of the fibfib number sequence.
-    >>> fibfib(1)
-    0
-    >>> fibfib(5)
-    4
-    >>> fibfib(8)
-    24
-    """
-    if n == 0:
-        return 0
-    if n == 1:
-        return 0
-    if n == 2:
-        return 1
-    
-    a, b, c = 0, 0, 1
-    for _ in range(3, n + 1):
-        a, b, c = b, c, a + b + c
-    return c

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/64.py

@@ -1,20 +0,0 @@
-def vowels_count(s):
-    """Write a function vowels_count which takes a string representing
-    a word as input and returns the number of vowels in the string.
-    Vowels in this case are 'a', 'e', 'i', 'o', 'u'. Here, 'y' is also a
-    vowel, but only when it is at the end of the given word.
-
-    Example:
-    >>> vowels_count("abcde")
-    2
-    >>> vowels_count("ACEDY")
-    3
-    """
-    vowels = 'aeiouAEIOU'
-    count = 0
-    for char in s:
-        if char in vowels:
-            count += 1
-    if s and s[-1] in 'yY':
-        count += 1
-    return count

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/65.py

@@ -1,14 +0,0 @@
-def circular_shift(x, shift):
-    """Circular shift the digits of the integer x, shift the digits right by shift
-    and return the result as a string.
-    If shift > number of digits, return digits reversed.
-    >>> circular_shift(12, 1)
-    "21"
-    >>> circular_shift(12, 2)
-    "12"
-    """
-    s = str(x)
-    if shift > len(s):
-        return s[::-1]
-    shift = shift % len(s)
-    return s[-shift:] + s[:-shift] if shift else s

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/66.py

@@ -1,14 +0,0 @@
-def digitSum(s):
-    """Task
-    Write a function that takes a string as input and returns the sum of the upper characters only'
-    ASCII codes.
-
-    Examples:
-        digitSum("") => 0
-        digitSum("abAB") => 131
-        digitSum("abcCd") => 67
-        digitSum("helloE") => 69
-        digitSum("woArBld") => 131
-        digitSum("aAaaaXa") => 153
-    """
-    return sum(ord(c) for c in s if c.isupper())

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/67.py

@@ -1,16 +0,0 @@
-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)

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/68.py

@@ -1,50 +0,0 @@
-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]

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/69.py

@@ -1,21 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/7.py

@@ -1,11 +0,0 @@
-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]

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/70.py

@@ -1,26 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/71.py

@@ -1,17 +0,0 @@
-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)

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/72.py

@@ -1,21 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/73.py

@@ -1,17 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/74.py

@@ -1,21 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/75.py

@@ -1,30 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/76.py

@@ -1,20 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/77.py

@@ -1,17 +0,0 @@
-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)

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/78.py

@@ -1,24 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/79.py

@@ -1,13 +0,0 @@
-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"

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/8.py

@@ -1,17 +0,0 @@
-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)

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/80.py

@@ -1,18 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/81.py

@@ -1,54 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/82.py

@@ -1,20 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/83.py

@@ -1,21 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/84.py

@@ -1,16 +0,0 @@
-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:]

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/85.py

@@ -1,12 +0,0 @@
-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

package/skills/loki-mode/benchmarks/results/2026-01-05-00-49-17/humaneval-solutions/86.py

@@ -1,16 +0,0 @@
-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)