{"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":"fc2f72cf-97da-5bbb-abfa-c20a8cead1ca","task_key":"full--validation--548","task_revision_id":"1","upstream_id":"548","short_description":"Write a function to find the length of the longest increasing subsequence of the…","config":"full","split":"validation","body":"{\"test_list\":\"['assert longest_increasing_subsequence([10, 22, 9, 33, 21, 50, 41, 60]) == 5', 'assert longest_increasing_subsequence([3, 10, 2, 1, 20]) == 3', 'assert longest_increasing_subsequence([50, 3, 10, 7, 40, 80]) == 4 ']\",\"text\":\"Write a function to find the length of the longest increasing subsequence of the given sequence.\"}","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":[]}