Given an integer array nums, select three distinct elements a, b, and c from the array to maximize the value of $a + b - c$.

Return the maximum value obtainable from the expression.

Constraints:

• $3 \leq$ nums.length $\leq 100$

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

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.