Given an integer array nums, identify three elements whose product is the largest possible, and return that maximum product.

Constraints:

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

• $-1000 \leq$ nums[i] $\leq 1000$

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.