{"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":"54f927e9-ac27-5fda-b18c-cf9f0395254c","task_key":"full--train--856","task_revision_id":"1","upstream_id":"856","short_description":"Write a python function to find minimum adjacent swaps required to sort binary…","config":"full","split":"train","body":"{\"test_list\":\"['assert find_Min_Swaps([1,0,1,0],4) == 3', 'assert find_Min_Swaps([0,1,0],3) == 1', 'assert find_Min_Swaps([0,0,1,1,0],5) == 2']\",\"text\":\"Write a python function to find minimum adjacent swaps required to sort binary array.\"}","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":[]}