{"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":"471e1909-1fb4-5a1a-95a4-e750ce47bc81","task_key":"full--validation--522","task_revision_id":"1","upstream_id":"522","short_description":"Write a function to find the longest bitonic subsequence for the given array.","config":"full","split":"validation","body":"{\"test_list\":\"['assert lbs([0 , 8 , 4, 12, 2, 10 , 6 , 14 , 1 , 9 , 5 , 13, 3, 11 , 7 , 15]) == 7', 'assert lbs([1, 11, 2, 10, 4, 5, 2, 1]) == 6', 'assert lbs([80, 60, 30, 40, 20, 10]) == 5']\",\"text\":\"Write a function to find the longest bitonic subsequence for the given 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":[]}