You are given an integer array nums.

An ordered triplet consists of three indices (i, j, k) such that i $<$ j $<$ k. The value of such a triplet is evaluated as (nums[i] $-$ nums[j]) $ imes$ nums[k].

Return the maximum value among all ordered triplets in nums. If every triplet yields a negative value, return $0$.

Constraints:

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

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

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.