benchmarks.wiki

benchmarks.wiki / Public workspace

BigCodeBench / BigCodeBench v0.1.0_hf 81634f87-f7fa-52a3-ad78-183fd7a39307

Problem

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

complete prompt

import numpy as np
from scipy.stats import mode

def task_func(list_of_lists):
    """
    Merges a predefined set of lists into a list and finds the mode of the elements in the list.

    Parameters:
    - list_of_lists (list): The list to be processed.

    Returns:
    - tuple: The mode and count of the mode in the merged list.
        - mode_value (np.array): The value that appears most frequently in the merged array.
        - mode_count (int): The frequency count of the mode_value within the merged array.

    Requirements:
    - numpy
    - scipy
    
    Example:
    >>> task_func([[1, 1, 3], [4, 5, 6], [7, 8, 9]])
    (array([1]), array([2]))
    """

instruct prompt

Merges a predefined set of lists into a list and finds the mode of the elements in the list.
The function should output with:
    tuple: The mode and count of the mode in the merged list.
    mode_value (np.array): The value that appears most frequently in the merged array.
    mode_count (int): The frequency count of the mode_value within the merged array.
You should write self-contained code starting with:

Code

import numpy as np
from scipy.stats import mode
def task_func(list_of_lists):

code prompt

Code

import numpy as np
from scipy.stats import mode
def task_func(list_of_lists):

entry point

task_func

libs

  • numpy
  • scipy

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
81634f87-f7fa-52a3-ad78-183fd7a39307
task_key
default--v0~2e1~2e0~5fhf--81634f87-f7fa-52a3-ad78-183fd7a39307
task_revision_id
1
config / split
default / v0.1.0_hf

Official source

initial import