{"kind":"task","effective_mode":"full","benchmark":{"kind":"benchmark","effective_mode":"full","slug":"livecodebench","formal_name":"LiveCodeBench","introduction":"LiveCodeBench continuously collects new competitive-programming problems to evaluate coding capabilities. Its initial release_v1 contains 400 problems, with source platform, contest date, and dataset version tracked explicitly.","introduction_ja":"","introduction_en":"","category":"Category not supplied","task_count":null,"acquisition_status":"Acquisition status not supplied","official_url":"https://livecodebench.github.io/","indexing_mode":"noindex","profile":{"resources":[],"task_format":"","scoring":"","metric":"","size":"","answer_access":"","license":"","citation":"","maintainer":"","released":"","why_hard":"","related":[]}},"task_id":"18d7148b-e8fb-5ab0-a9ab-df7d13451003","task_key":"release~5fv1--test--2754","task_revision_id":"1","upstream_id":"2754","short_description":"maximum-strength-of-a-group","config":"release_v1","split":"test","body":"{\"contest_date\":\"2023-05-27T00:00:00\",\"contest_id\":\"biweekly-contest-105\",\"difficulty\":\"medium\",\"platform\":\"leetcode\",\"question_content\":\"You are given a 0-indexed integer array nums representing the score of students in an exam. The teacher would like to form one non-empty group of students with maximal strength, where the strength of a group of students of indices i_0, i_1, i_2, ... , i_k is defined as nums[i_0] * nums[i_1] * nums[i_2] * ... * nums[i_k​].\\nReturn the maximum strength of a group the teacher can create.\\n \\nExample 1:\\n\\nInput: nums = [3,-1,-5,2,5,-9]\\nOutput: 1350\\nExplanation: One way to form a group of maximal strength is to group the students at indices [0,2,3,4,5]. Their strength is 3 * (-5) * 2 * 5 * (-9) = 1350, which we can show is optimal.\\n\\nExample 2:\\n\\nInput: nums = [-4,-5,-4]\\nOutput: 20\\nExplanation: Group the students at indices [0, 1] . Then, we’ll have a resulting strength of 20. We cannot achieve greater strength.\\n\\n \\nConstraints:\\n\\n1 <= nums.length <= 13\\n-9 <= nums[i] <= 9\",\"question_title\":\"maximum-strength-of-a-group\",\"starter_code\":\"class Solution:\\n    def maxStrength(self, nums: List[int]) -> int:\\n        \"}","display_format":"text","language":"","answer_status":"published","assets":[],"source_url":"https://livecodebench.github.io/","history":"initial import","indexing_mode":"noindex","subproblems":[],"grids":[]}