Leetcode 1464. Maximum Product of Two Elements in an Array
Given an integer array, pick two distinct indices to maximize (nums[i]-1)*(nums[j]-1). This is equivalent to selecting the two largest elements and returning (max1-1)*(max2-1).
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
0
Hello Interview Premium
Your account is free and you can post anonymously if you choose.