{"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":"e2b3c746-7883-53ae-b45a-47d680537aa3","task_key":"sanitized--train--607","task_revision_id":"1","upstream_id":"607","short_description":"Write a function to search a string for a regex pattern. The function should…","config":"sanitized","split":"train","body":"{\"prompt\":\"Write a function to search a string for a regex pattern. The function should return the matching subtring, a start index and an end index.\",\"test_list\":\"[\\\"assert find_literals('The quick brown fox jumps over the lazy dog.', 'fox') == ('fox', 16, 19)\\\", \\\"assert find_literals('Its been a very crazy procedure right', 'crazy') == ('crazy', 16, 21)\\\", \\\"assert find_literals('Hardest choices required strongest will', 'will') == ('will', 35, 39)\\\"]\"}","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":[]}