{"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":"0baea236-af52-5414-b6c9-cbf83c8f4df1","task_key":"full--test--247","task_revision_id":"1","upstream_id":"247","short_description":"Write a function to find the longest palindromic subsequence in the given…","config":"full","split":"test","body":"{\"test_list\":\"['assert lps(\\\"TENS FOR TENS\\\") == 5 ', 'assert lps(\\\"CARDIO FOR CARDS\\\") == 7', 'assert lps(\\\"PART OF THE JOURNEY IS PART\\\") == 9 ']\",\"text\":\"Write a function to find the longest palindromic subsequence in the given string.\"}","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":[]}