You are given an integer array nums.

You may perform at most $1$ operation where you choose an element in nums and replace it with any integer in the range $[-10^5, 10^5]$.

Return the maximum possible product of $3$ elements chosen from distinct indices in nums after performing at most $1$ replacement.

Constraints:

• $3 \leq$ nums.length $\leq 10^5$

• $-10^5 \leq$ nums[i] $\leq 10^5$

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.