You are given an integer array prices representing the prices of different chocolates in a store, and an integer money representing the initial amount of money you have.

You must buy exactly $2$ chocolates such that you do not end up in debt. To maximize the leftover money, you need to minimize the total cost of the two chosen chocolates.

Return the amount of money you will have remaining after purchasing two chocolates with the minimum total cost. If you cannot purchase $2$ chocolates without going into debt, return money.

Constraints:

• $2 \leq$ prices.length $\leq 50$

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

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