Skip to content

Practice Subarrays Distinct Element Sum of Squares I

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

Easy#2913
LeetCode Problem

Subarrays Distinct Element Sum of Squares I

Problem Statement

For every nonempty contiguous subarray of nums, count its distinct values, square that count, and add it to the answer. Return the resulting sum.

Source: Subarrays Distinct Element Sum of Squares I 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 = [1,1]
Output
3

Constraints

1 <= nums.length <= 100
1 <= nums[i] <= 100

Related LeetCode Problems

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

Review your practice with PhantomCodeAI

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