> For the complete documentation index, see [llms.txt](https://mayanktyagi3111.gitbook.io/interview-prep/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://mayanktyagi3111.gitbook.io/interview-prep/strings-arrays-and-2-pointers/maximum-product-of-two-elements-in-an-array.md).

# Maximum Product of Two Elements in an Array

Given the array of integers `nums`, you will choose two different indices `i` and `j` of that array. *Return the maximum value of* `(nums[i]-1)*(nums[j]-1)`.

**Example 1:**

```
Input: nums = [3,4,5,2]
Output: 12 
Explanation: If you choose the indices i=1 and j=2 (indexed from 0), you will get the maximum value, that is, (nums[1]-1)*(nums[2]-1) = (4-1)*(5-1) = 3*4 = 12. 
```

**Example 2:**

```
Input: nums = [1,5,4,5]
Output: 16
Explanation: Choosing the indices i=1 and j=3 (indexed from 0), you will get the maximum value of (5-1)*(5-1) = 16.
```

**Example 3:**

```
Input: nums = [3,7]
Output: 12
```

**Constraints:**

* `2 <= nums.length <= 500`
* `1 <= nums[i] <= 10^3`

```java
class Solution {
    public int maxProduct(int[] nums) {
        int max = Integer.MIN_VALUE, max2 = Integer.MIN_VALUE;
        for (int x : nums) {
            if (x > max) {
                max2 = max;
                max = x;
            } else if (x > max2)
                max2 = x;
        }
        return (max - 1) * (max2 - 1);
    }
}
```