Given an integer array nums, maximize the total points you can earn by repeatedly performing the following operation:

Choose an element nums[i] and delete it to earn nums[i] points. After deleting it, every element with value nums[i] - 1 or nums[i] + 1 must also be deleted, but these deleted elements earn no points.

Return the maximum number of points you can earn.

Constraints:

• $1 \leq$ nums.length $\leq 2 \times 10^4$

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

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.