Leetcode 2708. Maximum Strength of a Group
Pick a non-empty subset of the given array (n ≤ 13) to maximize the product; the core challenge is handling signs and zeros—pairing negatives, keeping positives, and possibly excluding elements (including zeros or a lone negative) to get the largest product.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Your account is free and you can post anonymously if you choose.