Given an integer array nums, you may choose exactly one contiguous subarray whose elements are all distinct. The value of a chosen subarray is the sum of its elements. Return the maximum possible value among all such subarrays.

Constraints:

• $1 \leq$ nums.length $\leq 10^5$

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

Input: nums = [7]-List[int]
Output: 7-int
Explanation: The only subarray is [7], which has all distinct elements and sum 7.

Input: nums = [1,2,3,4,5,6]-List[int]
Output: 21-int
Explanation: All elements are distinct, so the best choice is the entire array, with sum 1+2+3+4+5+6 = 21.

Input: nums = [9,9,9,9,9]-List[int]
Output: 9-int
Explanation: Any subarray of length greater than 1 contains duplicates, so the best distinct subarray is any single [9], with sum 9.

Input: nums = [3,1,2,3,4,2,5,6,5,7]-List[int]
Output: 20-int
Explanation: One optimal distinct subarray is [3,4,2,5,6] (indices 3 to 7), with sum 3+4+2+5+6 = 20. Any attempt to extend it introduces a duplicate (5 or 3).

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.