You are given an array stones where each element represents the weight of a stone. Repeatedly perform the following operation while there are at least two stones remaining:

Select the two stones with the largest weights, say x and y with x <= y. Smash them together:
If x == y, both stones are destroyed.
If x != y, the stone of weight x is destroyed and the stone of weight y becomes a new stone with weight y - x.

Return the weight of the final remaining stone. If no stones remain, return $0$.

Constraints:

• $1 \leq$ stones.length $\leq 30$

• $1 \leq$ stones[i] $\leq 1000$

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.