1464. Maximum Product of Two Elements in an Array(Solution || Leetcode easy || Java)

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

SOLUTION:

class Solution {
    public int maxProduct(int[] nums) {
        //In simple words the question is asking you to return
       // the product of the largest elements in the array and
      // subtract 1 from both of them before doing their product
        int max1 = 0;
        int max2 = 0;
        
        int i = 0;
        
        while(i < nums.length){
            if(nums[i] >= max1){
                max2 = max1;
                max1 = nums[i];
            }
            else if(nums[i] >= max2){
                max2 = nums[i];
            }
            
            i++;
        }
        
        //After finding the two largest elements subtract 1
       // from both of them and return their product
        return (max1 -1)*(max2 -1);
    }
}

Runtime: 2 ms, faster than 84.17% of Java online submissions for Maximum Product of Two Elements in an Array.

Memory Usage: 43.4 MB, less than 43.38% of Java online submissions for Maximum Product of Two Elements in an Array.

Thank you for reading. If you have any queries then, please let me know in the comment section. I will surely be responsive toward it.