You are given an integer array nums.

A triplet of indices (i, j, k) is called an increasing triplet if:

• i $<$ j $<$ k

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

The value of an increasing triplet (i, j, k) is equal to nums[i] - nums[j] + nums[k].

Return the maximum value among all increasing triplets in nums.

Constraints:

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

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

• The input is generated such that at least one triplet meets the given condition.

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.