2907. Maximum Profitable Triplets With Increasing Prices I

Let's fix the middle chosen item.

For a fixed item with an index j, iterate over items with an index k > j such that prices[k] > prices[j].

Find the maximum profit[k] with the above condition. Let's call this maximum value max_right.

Do the same for items with an index i < j such that prices[i] < prices[j] and find the maximum profit[i] among them. Let's call this maximum value max_left.

Now the profit when an item with the index j is the middle one would be profit[j] + max_right + max_left.

Finally, do the above procedure for all j's and find the maximum profit among them. That would be the final answer.