{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"mbpp","formal_name":"MBPP","introduction":"Mostly Basic Python Problems asks for a short Python function from a one-sentence description, checked by assertions. The sanitized split is the hand-verified subset.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://huggingface.co/datasets/google-research-datasets/mbpp","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":"af330678-e355-5d92-bdf8-a4c8d4581840","task_key":"full--test--181","task_revision_id":"1","upstream_id":"181","short_description":"Write a function to find the longest common prefix in the given set of strings.","config":"full","split":"test","body":"{\"test_list\":\"['assert common_prefix([\\\"tablets\\\", \\\"tables\\\", \\\"taxi\\\", \\\"tamarind\\\"], 4) == \\\\'ta\\\\'', 'assert common_prefix([\\\"apples\\\", \\\"ape\\\", \\\"april\\\"], 3) == \\\\'ap\\\\'', 'assert common_prefix([\\\"teens\\\", \\\"teenager\\\", \\\"teenmar\\\"], 3) == \\\\'teen\\\\'']\",\"text\":\"Write a function to find the longest common prefix in the given set of strings.\"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://huggingface.co/datasets/google-research-datasets/mbpp","history":"initial import","indexing_mode":"index","subproblems":[],"grids":[]}