{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"bigcodebench","formal_name":"BigCodeBench","introduction":"BigCodeBench poses 1,140 function-level tasks drawn across 139 libraries. It tests whether a model can compose several real APIs correctly rather than write one self-contained function.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://bigcode-bench.github.io/","indexing_mode":"index","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[],"history":"","construction":"","limitations":"","saturation":"","scores":[]}},"task_id":"858aa734-25e7-58e5-985d-462fdd5ee50e","task_key":"default--v0~2e1~2e0~5fhf--858aa734-25e7-58e5-985d-462fdd5ee50e","task_revision_id":"1","upstream_id":"","short_description":"BigCodeBench v0.1.0_hf 858aa734-25e7-58e5-985d-462fdd5ee50e","config":"default","split":"v0.1.0_hf","body":"{\"code_prompt\":\"from collections import Counter\\nimport re\\ndef task_func(word: str) -> list:\\n\",\"complete_prompt\":\"from collections import Counter\\nimport re\\n\\ndef task_func(word: str) -> list:\\n    \\\"\\\"\\\"\\n    Finds the most common two-letter combination in a given, cleaned word (lowercased and alphabetic characters only) \\n    and returns its frequency. The search is case-insensitive and ignores non-alphabetic characters.\\n    \\n    Requirements:\\n    - collections.Counter\\n    - re\\n    \\n    Parameters:\\n    - word (str): The input string containing the word to analyze. The word should have a length of at least 2 to form pairs.\\n    \\n    Returns:\\n    - list: A list containing a single tuple. The tuple consists of the most frequent two-letter combination (str) \\n      and its frequency (int). Returns an empty list if the word has fewer than 2 letters, or after cleaning, \\n      the word has fewer than 2 alphabetic characters.\\n    \\n    Examples:\\n    >>> task_func(\\\"aaBBcc\\\")\\n    [('aa', 1)]\\n    >>> task_func(\\\"abc!abc\\\")\\n    [('ab', 2)]\\n    >>> task_func(\\\"a\\\")\\n    []\\n    >>> task_func(\\\"abcd\\\")\\n    [('ab', 1)]\\n    >>> task_func(\\\"a1b2c3\\\")\\n    [('ab', 1)]\\n    \\\"\\\"\\\"\\n\",\"entry_point\":\"task_func\",\"instruct_prompt\":\"Finds the most common two-letter combination in a given, cleaned word (lowercased and alphabetic characters only) and returns its frequency. The search is case-insensitive and ignores non-alphabetic characters.\\nThe function should output with:\\n    list: A list containing a single tuple. The tuple consists of the most frequent two-letter combination (str)\\n    and its frequency (int). Returns an empty list if the word has fewer than 2 letters, or after cleaning,\\n    the word has fewer than 2 alphabetic characters.\\nYou should write self-contained code starting with:\\n```\\nfrom collections import Counter\\nimport re\\ndef task_func(word: str) -> list:\\n```\",\"libs\":\"['collections', 're']\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://bigcode-bench.github.io/","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}