{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"humaneval-plus","formal_name":"HumanEval+","introduction":"HumanEval+ keeps the 164 original HumanEval problems and multiplies their tests by roughly 80×. It exists because the original suite was loose enough to pass implementations that were actually wrong.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://github.com/evalplus/evalplus","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"1a245ecc-ab61-5524-96e5-566b8534c8bc","task_key":"default--test--1a245ecc-ab61-5524-96e5-566b8534c8bc","task_revision_id":"2","upstream_id":"","short_description":"def find_max(words):","config":"default","split":"test","body":"{\"entry_point\":\"find_max\",\"prompt\":\"\\ndef find_max(words):\\n    \\\"\\\"\\\"Write a function that accepts a list of strings.\\n    The list contains different words. Return the word with maximum number\\n    of unique characters. If multiple strings have maximum number of unique\\n    characters, return the one which comes first in lexicographical order.\\n\\n    find_max([\\\"name\\\", \\\"of\\\", \\\"string\\\"]) == \\\"string\\\"\\n    find_max([\\\"name\\\", \\\"enam\\\", \\\"game\\\"]) == \\\"enam\\\"\\n    find_max([\\\"aaaaaaa\\\", \\\"bb\\\" ,\\\"cc\\\"]) == \\\"\\\"aaaaaaa\\\"\\n    \\\"\\\"\\\"\\n\"}","display_format":"code","language":"","answer_status":"published","assets":[],"source_url":"https://github.com/evalplus/evalplus","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}