Sponsored
Use these hints if you're stuck. Try solving on your own first.
Use brute force: two loops to select i and j, then select the maximum value of (nums[i]-1)*(nums[j]-1).
Solve with full IDE support and test cases
