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.