You are given an integer array nums.

You may delete any number of elements from nums. After performing the deletions, select a contiguous subarray from the remaining array such that all elements in the selected subarray are unique.

Return the maximum possible sum of such a subarray.

Constraints:

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