Solution (leetcode-in-java 1.24 API)

java.lang.Object
- g2701_2800.s2708_maximum_strength_of_a_group.Solution

```
public class Solution
extends Object
```
2708 - Maximum Strength of a Group.
Medium

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₀, i₁, i₂, … , i_k is defined as nums[i₀] * nums[i₁] * nums[i₂] * … * nums[i_k].

Return the maximum strength of a group the teacher can create.

Example 1:

Input: nums = [3,-1,-5,2,5,-9]

Output: 1350

Explanation: 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.

Example 2:

Input: nums = [-4,-5,-4]

Output: 20

Explanation: Group the students at indices [0, 1] . Then, we\u2019ll have a resulting strength of 20. We cannot achieve greater strength.

Constraints:
- 1 <= nums.length <= 13
- -9 <= nums[i] <= 9

- Constructor Summary
  
  Constructors
  Constructor Description
  
  Solution()
- Method Summary
  
  All Methods Instance Methods Concrete Methods
  Modifier and Type Method Description
  
  long maxStrength(int[] nums)
  - Methods inherited from class java.lang.Object
    clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail
- Solution
```
public Solution()
```

Method Detail

maxStrength

public long maxStrength(int[] nums)