Given an integer array nums, choose two different indices i and j from the array. Return the maximum possible value of ( nums[i] $- 1) imes ($ nums[j] $- 1)$.

Constraints:

• $2 \leq$ nums.length $\leq 500$

• $1 \leq$ nums[i] $\leq 10^3$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.