<p>You are given a <strong>0-indexed</strong> array <code>nums</code> consisting of <strong>positive</strong> integers.</p>

<p>A partition of an array into one or more <strong>contiguous</strong> subarrays is called <strong>good</strong> if no two subarrays contain the same number.</p>

<p>Return <em>the <strong>total number</strong> of good partitions of </em><code>nums</code>.</p>

<p>Since the answer may be large, return it <strong>modulo</strong> <code>10<sup>9</sup> + 7</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,3,4]
<strong>Output:</strong> 8
<strong>Explanation:</strong> The 8 possible good partitions are: ([1], [2], [3], [4]), ([1], [2], [3,4]), ([1], [2,3], [4]), ([1], [2,3,4]), ([1,2], [3], [4]), ([1,2], [3,4]), ([1,2,3], [4]), and ([1,2,3,4]).
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,1,1,1]
<strong>Output:</strong> 1
<strong>Explanation:</strong> The only possible good partition is: ([1,1,1,1]).
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums = [1,2,1,3]
<strong>Output:</strong> 2
<strong>Explanation:</strong> The 2 possible good partitions are: ([1,2,1], [3]) and ([1,2,1,3]).
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= nums.length &lt;= 10<sup>5</sup></code></li>
	<li><code>1 &lt;= nums[i] &lt;= 10<sup>9</sup></code></li>
</ul>

class Solution:
    def numberOfGoodPartitions(self, nums: List[int]) -> int:

        mod = 10 ** 9 + 7
        hashtable = defaultdict(list)
        n = len(nums)
        i = 0
        while i < len(nums):
            if len(hashtable[nums[i]]) > 1:
                hashtable[nums[i]][1] = i
            else:
                hashtable[nums[i]].append(i)
                hashtable[nums[i]].append(i)
            i += 1
        sorty = list(hashtable.values())
        print(sorty)
        start = sorty[0][0]
        end = sorty[0][1]
        res = []
        if len(sorty) == 1:
            res.append([start,end])
        for i in range(1,len(sorty)):
            if end > sorty[i][0]:
                end = max(sorty[i][1],end)
            else:
                res.append([start,end])
                start = sorty[i][0]
                end = sorty[i][1]
        if res and res[-1][0] == start and res[-1][1] == end:
            pass
        else:
            res.append([start,end])
        return pow(2,len(res)-1,mod) #2**(totalNums-1)
902