Find the 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).
LeetCode Problem: Link | Click Here
class Solution {
public int maxProduct(int[] nums) {
/...
perfinsights.hashnode.dev1 min read