{"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":"7ab660e8-ab1a-5ce3-b523-de526b9cf3b5","task_key":"full--test--326","task_revision_id":"1","upstream_id":"326","short_description":"Write a function to get the word with most number of occurrences in the given…","config":"full","split":"test","body":"{\"test_list\":\"['assert most_occurrences([\\\"UTS is best for RTF\\\", \\\"RTF love UTS\\\", \\\"UTS is best\\\"] ) == \\\\'UTS\\\\'', 'assert most_occurrences([\\\"Its been a great year\\\", \\\"this year is so worse\\\", \\\"this year is okay\\\"] ) == \\\\'year\\\\'', 'assert most_occurrences([\\\"Families can be reunited\\\", \\\"people can be reunited\\\", \\\"Tasks can be achieved \\\"] ) == \\\\'can\\\\'']\",\"text\":\"Write a function to get the word with most number of occurrences in the given strings list.\"}","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":[]}