Given two integer arrays prices and profits of the same length, where prices[i] represents the price of the $i^{ {th}}$ item and profits[i] represents the profit of the $i^{ {th}}$ item.

Find three indices i, j, and k such that:

• $i < j < k$

• prices[i] $<$ prices[j] $<$ prices[k]

Return the maximum possible profit sum profits[i] + profits[j] + profits[k]. If no such triplet exists, return $-1$.

Constraints:

• $3 \leq$ prices.length == profits.length $\leq 50000$

• $1 \leq$ prices[i] $\leq 5000$

• $1 \leq$ profits[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.