Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1464. Maximum Product of Two Elements in an Array
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source