You are given an array of positive integers nums.

A partition of an array into one or more contiguous subarrays is considered good if no two distinct subarrays contain the same value.

Return the total number of good partitions of nums. Since the answer may be very large, return it modulo $10^9 + 7$.

Constraints:

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

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

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.