Skip to content

Practice Subarrays Distinct Element Sum of Squares II

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#2916
LeetCode Problem

Subarrays Distinct Element Sum of Squares II

Problem Statement

For every nonempty contiguous subarray of nums, count its distinct values and square that count. Return the sum of those squares over all subarrays, modulo 10^9 + 7.

Source: Subarrays Distinct Element Sum of Squares II on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [1,2,1]
Output
15

# Example 2

Input
nums = [2,2]
Output
3

Constraints

1 <= nums.length <= 10^5
1 <= nums[i] <= 10^5

Related LeetCode Problems

Practice more problems similar to Subarrays Distinct Element Sum of Squares II.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.