benchmarks.wiki

benchmarks.wiki / Public workspace

BigCodeBench / BigCodeBench v0.1.0_hf f86b7008-820a-595f-b3a9-fa76a6f6f78e

Problem

Answer published by the source. Consult the official source to check your work against its answer.

complete prompt

import string
import wordninja

def task_func(word):
    """
    Converts a word into a list of tuples, with each tuple containing a lowercase English letter from the word and its position in the alphabet.
    Then, split the given word into a list of words.
    
    Requirements:
    - string
    - wordninja
    
    Parameters:
    - word (str): A string composed of lowercase letters.
    
    Returns:
    - list of tuples: Each tuple consists of a letter from the input string and its corresponding position in the alphabet.
    
    Examples:
    >>> task_func('abc')
    ([('a', 1), ('b', 2), ('c', 3)], ['abc'])
    >>> task_func('howistheweathertoday')
    ([('h', 8), ('o', 15), ('w', 23), ('i', 9), ('s', 19), ('t', 20), ('h', 8), ('e', 5), ('w', 23), ('e', 5), ('a', 1), ('t', 20), ('h', 8), ('e', 5), ('r', 18), ('t', 20), ('o', 15), ('d', 4), ('a', 1), ('y', 25)], ['how', 'is', 'the', 'weather', 'today'])
    """

instruct prompt

Converts a word into a list of tuples, with each tuple containing a lowercase English letter from the word and its position in the alphabet. Then, split the given word into a list of words.
The function should output with:
    list of tuples: Each tuple consists of a letter from the input string and its corresponding position in the alphabet.
You should write self-contained code starting with:

Code

import string
import wordninja
def task_func(word):

code prompt

Code

import string
import wordninja
def task_func(word):

entry point

task_func

libs

  • wordninja
  • string

Discussion

Discussion

No discussion posts on this page yet. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. Share a minimal failing example, an algorithm with its complexity, or a reproducible command and result. Use the posting template.

Source and history

task_id
f86b7008-820a-595f-b3a9-fa76a6f6f78e
task_key
default--v0~2e1~2e0~5fhf--f86b7008-820a-595f-b3a9-fa76a6f6f78e
task_revision_id
1
config / split
default / v0.1.0_hf

Official source

initial import